/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:51:44,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:51:44,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:51:44,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:51:44,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:51:44,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:51:44,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:51:44,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:51:44,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:51:44,371 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:51:44,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:51:44,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:51:44,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:51:44,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:51:44,372 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:51:44,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:51:44,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:51:44,373 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:51:44,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:51:44,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:51:44,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:51:44,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:51:44,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:51:44,378 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:51:44,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:51:44,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:51:44,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:51:44,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:51:44,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:44,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:51:44,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:51:44,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:51:44,380 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:51:44,380 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:51:44,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:51:44,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:51:44,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:51:44,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:51:44,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:51:44,587 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:51:44,591 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:51:44,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound20.i [2023-12-25 03:51:45,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:51:45,815 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:51:45,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound20.i [2023-12-25 03:51:45,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aba9d19f/3f7f31a2d81f40fb8d62890932a323e7/FLAGcd5573171 [2023-12-25 03:51:45,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aba9d19f/3f7f31a2d81f40fb8d62890932a323e7 [2023-12-25 03:51:45,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:51:45,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:51:45,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:45,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:51:45,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:51:45,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:45" (1/1) ... [2023-12-25 03:51:45,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353b5b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:45, skipping insertion in model container [2023-12-25 03:51:45,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:45" (1/1) ... [2023-12-25 03:51:45,887 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:51:46,020 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound20.i[948,961] [2023-12-25 03:51:46,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:46,073 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:51:46,083 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound20.i[948,961] [2023-12-25 03:51:46,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:46,110 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:51:46,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46 WrapperNode [2023-12-25 03:51:46,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:46,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:46,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:51:46,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:51:46,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,134 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2023-12-25 03:51:46,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:46,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:51:46,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:51:46,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:51:46,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,152 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 03:51:46,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:51:46,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:51:46,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:51:46,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:51:46,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (1/1) ... [2023-12-25 03:51:46,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:51:46,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:51:46,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:51:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:51:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:51:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:51:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:51:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:51:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:51:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:51:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:51:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:51:46,259 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:51:46,260 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:51:51,176 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:51:51,212 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:51:51,212 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 03:51:51,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:51 BoogieIcfgContainer [2023-12-25 03:51:51,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:51:51,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:51:51,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:51:51,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:51:51,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:51:45" (1/3) ... [2023-12-25 03:51:51,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d7ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:51, skipping insertion in model container [2023-12-25 03:51:51,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:46" (2/3) ... [2023-12-25 03:51:51,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d7ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:51, skipping insertion in model container [2023-12-25 03:51:51,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:51" (3/3) ... [2023-12-25 03:51:51,218 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound20.i [2023-12-25 03:51:51,229 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:51:51,230 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:51:51,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:51:51,260 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@332444f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:51:51,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:51:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 03:51:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:51:51,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:51:51,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:51:51,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:51:51,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:51:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1677847985, now seen corresponding path program 1 times [2023-12-25 03:51:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:51:51,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607380703] [2023-12-25 03:51:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:51:51,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:51:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:51:51,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:51:51,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:51:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:51:51,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:51:51,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:51:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 03:51:51,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:51:51,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:51:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607380703] [2023-12-25 03:51:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607380703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:51:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:51:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:51:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512724010] [2023-12-25 03:51:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:51:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:51:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:51:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:51:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:51:51,568 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 03:51:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:51:51,633 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2023-12-25 03:51:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:51:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 03:51:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:51:51,640 INFO L225 Difference]: With dead ends: 54 [2023-12-25 03:51:51,640 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 03:51:51,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:51:51,647 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:51:51,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:51:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 03:51:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 03:51:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 03:51:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-25 03:51:51,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 28 [2023-12-25 03:51:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:51:51,672 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-25 03:51:51,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 03:51:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-25 03:51:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:51:51,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:51:51,674 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:51:51,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 03:51:51,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:51:51,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:51:51,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:51:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -201606027, now seen corresponding path program 1 times [2023-12-25 03:51:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:51:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743677838] [2023-12-25 03:51:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:51:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:51:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:51:51,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:51:51,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:51:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:51:54,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:51:54,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:52:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 03:52:05,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:52:20,660 WARN L876 $PredicateComparison]: unable to prove that (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2)) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv8 32) .cse3) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse3))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse0))))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) is different from true [2023-12-25 03:52:33,547 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:52:37,888 WARN L876 $PredicateComparison]: unable to prove that (or (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2)) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv8 32) .cse3) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse3))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse0))))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32)))) is different from true [2023-12-25 03:52:54,352 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:52:58,404 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse0))) (bvmul (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul .cse3 (_ bv8 32)) (bvmul (_ bv8 32) .cse2)))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:53:14,835 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:53:31,238 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:53:35,318 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse0))) (bvmul (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul .cse3 (_ bv8 32)) (bvmul (_ bv8 32) .cse2)))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:53:47,828 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:05,048 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:13,202 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:17,455 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (or (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse3 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse3)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)))) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1| .cse1)) (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul .cse2 (_ bv8 32))))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse2 |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse3))))))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv20 32))))) is different from true [2023-12-25 03:54:17,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:54:17,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743677838] [2023-12-25 03:54:17,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743677838] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:54:17,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461516547] [2023-12-25 03:54:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:54:17,457 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:54:17,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:54:17,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:54:17,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-25 03:54:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:54:28,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 03:54:28,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:54:42,961 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:55:00,158 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:55:08,360 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:55:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 03:55:12,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:55:30,850 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:55:47,379 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:55:51,454 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))) (bvadd (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse1))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse3)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvadd (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv8 32) .cse3))))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:56:07,909 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:24,426 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:28,546 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))) (bvadd (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse1))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse3)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvadd (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv8 32) .cse3))))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 32)))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:56:41,227 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:58,293 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:57:06,477 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:57:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [461516547] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:57:06,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:57:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-12-25 03:57:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904317205] [2023-12-25 03:57:06,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:57:06,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 03:57:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:57:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 03:57:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=7, NotChecked=196, Total=380 [2023-12-25 03:57:06,480 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 03:57:13,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:17,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:21,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:25,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:29,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:57:40,754 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2023-12-25 03:57:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 03:57:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-12-25 03:57:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:57:40,778 INFO L225 Difference]: With dead ends: 43 [2023-12-25 03:57:40,779 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 03:57:40,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=61, Invalid=200, Unknown=7, NotChecked=238, Total=506 [2023-12-25 03:57:40,780 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:57:40,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 89 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 30.5s Time] [2023-12-25 03:57:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 03:57:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-12-25 03:57:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:57:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 03:57:40,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 28 [2023-12-25 03:57:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:57:40,787 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 03:57:40,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 03:57:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 03:57:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 03:57:40,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:57:40,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:57:40,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-25 03:57:41,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 03:57:41,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:57:41,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:57:41,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:57:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -48751610, now seen corresponding path program 1 times [2023-12-25 03:57:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:57:41,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997818231] [2023-12-25 03:57:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:57:41,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:57:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:57:41,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:57:41,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:57:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:57:41,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:57:41,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:57:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:57:42,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:57:42,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:57:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997818231] [2023-12-25 03:57:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997818231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:57:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:57:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:57:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569591444] [2023-12-25 03:57:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:57:42,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:57:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:57:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:57:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:57:42,021 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:57:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:57:43,216 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-25 03:57:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:57:43,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-25 03:57:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:57:43,235 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:57:43,235 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:57:43,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:57:43,236 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:57:43,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 03:57:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:57:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-12-25 03:57:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 03:57:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-25 03:57:43,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 33 [2023-12-25 03:57:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:57:43,242 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-25 03:57:43,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:57:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-25 03:57:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 03:57:43,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:57:43,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:57:43,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 03:57:43,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:57:43,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:57:43,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:57:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1500178133, now seen corresponding path program 1 times [2023-12-25 03:57:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:57:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112659213] [2023-12-25 03:57:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:57:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:57:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:57:43,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:57:43,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:57:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:57:47,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 03:57:47,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:58:20,538 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:58:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 03:58:34,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:59:13,060 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:59:17,568 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse4 (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse2))) (.cse6 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1))) (.cse3 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvneg (bvmul .cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse1) (bvmul (_ bv4 32) .cse2)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse3) .cse4 .cse5 .cse6 .cse7) (_ bv0 32)) (not (= (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)))) .cse4 .cse5 .cse6 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) .cse7) .cse3)))))) is different from true [2023-12-25 03:59:30,502 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:59:38,696 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:59:43,190 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse4 (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse2))) (.cse6 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1))) (.cse3 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvneg (bvmul .cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse1) (bvmul (_ bv4 32) .cse2)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse3) .cse4 .cse5 .cse6 .cse7) (_ bv0 32)) (not (= (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)))) .cse4 .cse5 .cse6 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) .cse7) .cse3)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))))) is different from true [2023-12-25 03:59:55,501 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:08,600 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:12,662 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul (_ bv8 32) .cse0)) (.cse4 (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|))) (or (not (= (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse0) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) .cse3 .cse4 .cse5 .cse6) .cse7)) (= (bvadd .cse3 .cse4 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse0)) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse2) (bvmul (_ bv4 32) .cse1)) (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:00:24,963 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:37,596 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:49,866 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:02,733 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:06,841 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul (_ bv8 32) .cse0)) (.cse4 (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|))) (or (not (= (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse0) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) .cse3 .cse4 .cse5 .cse6) .cse7)) (= (bvadd .cse3 .cse4 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse0)) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse2) (bvmul (_ bv4 32) .cse1)) (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:01:19,390 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:27,617 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:44,840 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:53,070 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:01,289 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:05,838 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (let ((.cse8 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse4 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse3 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8))) (let ((.cse2 (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1| .cse3))) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (.cse5 (bvmul (_ bv8 32) .cse1)) (.cse6 (bvmul (_ bv4 32) (bvmul .cse4 |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse7 (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8))))) (or (not (= .cse0 (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse1))) .cse2 (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse3) (bvmul .cse4 (_ bv8 32))))) .cse5 .cse6 .cse7))) (= (_ bv0 32) (bvadd .cse2 (bvneg (bvmul (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvadd (bvmul (_ bv4 32) .cse3) (bvmul .cse4 (_ bv4 32))))) (bvneg .cse0) .cse5 .cse6 .cse7 (bvneg (bvmul (bvmul (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) .cse1)))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv20 32)))))))) is different from true [2023-12-25 04:02:05,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:02:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112659213] [2023-12-25 04:02:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112659213] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:02:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [159333608] [2023-12-25 04:02:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:02:05,839 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:02:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:02:05,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:02:05,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 04:02:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:02:16,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:02:16,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:02:55,455 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:03,199 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 29 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:03:03,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:03:22,531 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:35,683 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:43,869 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:56,114 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:04:04,280 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:04:12,789 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8))) (let ((.cse3 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31|)) (.cse4 (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| .cse0))) (.cse5 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse6 (bvmul (_ bv8 32) .cse2))) (or (not (= (bvadd (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse0) (bvmul .cse1 (_ bv8 32))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (bvmul (_ bv4 32) .cse2))) .cse3 .cse4 .cse5 .cse6) .cse7)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ bv2 32)) (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) .cse2)) .cse3 (bvneg .cse7) (bvneg (bvmul (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) (bvadd (bvmul (_ bv4 32) .cse0) (bvmul (_ bv4 32) .cse1)))) .cse4 .cse5 .cse6))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:04:25,019 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:04:33,232 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:04:50,029 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:04:58,214 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:06,603 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8))) (let ((.cse3 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31|)) (.cse4 (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| .cse0))) (.cse5 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse6 (bvmul (_ bv8 32) .cse2))) (or (not (= (bvadd (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse0) (bvmul .cse1 (_ bv8 32))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (bvmul (_ bv4 32) .cse2))) .cse3 .cse4 .cse5 .cse6) .cse7)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ bv2 32)) (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) .cse2)) .cse3 (bvneg .cse7) (bvneg (bvmul (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) (bvadd (bvmul (_ bv4 32) .cse0) (bvmul (_ bv4 32) .cse1)))) .cse4 .cse5 .cse6))))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:05:19,147 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:27,352 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:44,943 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:53,159 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:06:01,357 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:06:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [159333608] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:06:01,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:06:01,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-12-25 04:06:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234037254] [2023-12-25 04:06:01,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:06:01,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 04:06:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:06:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 04:06:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=227, Unknown=8, NotChecked=252, Total=552 [2023-12-25 04:06:01,359 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 04:06:13,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:06:17,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:06:21,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:06:25,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:06:29,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:06:33,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 04:06:33,845 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:33,865 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:33,868 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:34,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:06:34,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-25 04:06:35,046 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 04:06:35,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 04:06:35,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=69, Invalid=257, Unknown=8, NotChecked=266, Total=600 [2023-12-25 04:06:35,097 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2023-12-25 04:06:35,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 31.2s Time] [2023-12-25 04:06:35,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:06:35,099 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 04:06:35,102 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-25 04:06:35,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:06:35,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:06:35 BoogieIcfgContainer [2023-12-25 04:06:35,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:06:35,105 INFO L158 Benchmark]: Toolchain (without parser) took 889249.94ms. Allocated memory was 255.9MB in the beginning and 332.4MB in the end (delta: 76.5MB). Free memory was 216.0MB in the beginning and 156.1MB in the end (delta: 59.9MB). Peak memory consumption was 137.8MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,105 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:06:35,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.63ms. Allocated memory is still 255.9MB. Free memory was 215.7MB in the beginning and 202.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 255.9MB. Free memory was 202.8MB in the beginning and 201.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,106 INFO L158 Benchmark]: Boogie Preprocessor took 27.61ms. Allocated memory is still 255.9MB. Free memory was 201.0MB in the beginning and 198.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,106 INFO L158 Benchmark]: RCFGBuilder took 5049.56ms. Allocated memory is still 255.9MB. Free memory was 198.6MB in the beginning and 181.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,106 INFO L158 Benchmark]: TraceAbstraction took 883890.54ms. Allocated memory was 255.9MB in the beginning and 332.4MB in the end (delta: 76.5MB). Free memory was 181.1MB in the beginning and 156.1MB in the end (delta: 24.9MB). Peak memory consumption was 103.2MB. Max. memory is 8.0GB. [2023-12-25 04:06:35,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.63ms. Allocated memory is still 255.9MB. Free memory was 215.7MB in the beginning and 202.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 255.9MB. Free memory was 202.8MB in the beginning and 201.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.61ms. Allocated memory is still 255.9MB. Free memory was 201.0MB in the beginning and 198.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 5049.56ms. Allocated memory is still 255.9MB. Free memory was 198.6MB in the beginning and 181.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 883890.54ms. Allocated memory was 255.9MB in the beginning and 332.4MB in the end (delta: 76.5MB). Free memory was 181.1MB in the beginning and 156.1MB in the end (delta: 24.9MB). Peak memory consumption was 103.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.9s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 62.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 61.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 94 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 114.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 28.3s SatisfiabilityAnalysisTime, 785.0s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 1004 SizeOfPredicates, 23 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 130/162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown