/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/geo2-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:59:30,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:59:30,072 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 02:59:30,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:59:30,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:59:30,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:59:30,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:59:30,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:59:30,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:59:30,103 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:59:30,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:59:30,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:59:30,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:59:30,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:59:30,105 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:59:30,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:59:30,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:59:30,106 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:59:30,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:59:30,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:59:30,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:59:30,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:59:30,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:59:30,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:59:30,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:59:30,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:59:30,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:59:30,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:59:30,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:59:30,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:59:30,111 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:59:30,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:59:30,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:59:30,111 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:59:30,111 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 02:59:30,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:59:30,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:59:30,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:59:30,308 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:59:30,309 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:59:30,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound20.c [2023-12-25 02:59:31,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:59:31,375 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:59:31,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound20.c [2023-12-25 02:59:31,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3375197b/ee0bb5031d47429386313b900c54d2f0/FLAGa5e2c67b5 [2023-12-25 02:59:31,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3375197b/ee0bb5031d47429386313b900c54d2f0 [2023-12-25 02:59:31,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:59:31,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:59:31,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:59:31,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:59:31,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:59:31,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163bebe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31, skipping insertion in model container [2023-12-25 02:59:31,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,415 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:59:31,534 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/geo2-ll_valuebound20.c[524,537] [2023-12-25 02:59:31,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:59:31,556 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:59:31,564 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/geo2-ll_valuebound20.c[524,537] [2023-12-25 02:59:31,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:59:31,588 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:59:31,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31 WrapperNode [2023-12-25 02:59:31,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:59:31,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:59:31,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:59:31,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:59:31,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,612 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-12-25 02:59:31,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:59:31,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:59:31,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:59:31,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:59:31,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 02:59:31,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:59:31,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:59:31,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:59:31,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:59:31,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (1/1) ... [2023-12-25 02:59:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:59:31,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:59:31,698 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 02:59:31,720 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 02:59:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:59:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:59:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:59:31,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:59:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:59:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:59:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:59:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:59:31,787 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:59:31,790 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:59:32,029 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:59:32,073 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:59:32,073 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 02:59:32,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:59:32 BoogieIcfgContainer [2023-12-25 02:59:32,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:59:32,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:59:32,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:59:32,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:59:32,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:59:31" (1/3) ... [2023-12-25 02:59:32,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e612b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:59:32, skipping insertion in model container [2023-12-25 02:59:32,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:31" (2/3) ... [2023-12-25 02:59:32,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e612b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:59:32, skipping insertion in model container [2023-12-25 02:59:32,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:59:32" (3/3) ... [2023-12-25 02:59:32,096 INFO L112 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound20.c [2023-12-25 02:59:32,108 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:59:32,110 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:59:32,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:59:32,153 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;@3615357d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:59:32,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:59:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:59:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 02:59:32,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:32,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:32,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:32,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1508852555, now seen corresponding path program 1 times [2023-12-25 02:59:32,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:32,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735550743] [2023-12-25 02:59:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:32,173 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 02:59:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:32,178 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 02:59:32,191 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 02:59:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:32,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:59:32,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:59:32,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:59:32,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:59:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735550743] [2023-12-25 02:59:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735550743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:59:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:59:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:59:32,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288054537] [2023-12-25 02:59:32,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:59:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:59:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:59:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:59:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:59:32,342 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:59:32,380 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-25 02:59:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:59:32,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 02:59:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:59:32,386 INFO L225 Difference]: With dead ends: 40 [2023-12-25 02:59:32,386 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 02:59:32,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 02:59:32,390 INFO L413 NwaCegarLoop]: 21 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, 21 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 02:59:32,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:59:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 02:59:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 02:59:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 02:59:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-25 02:59:32,431 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2023-12-25 02:59:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:59:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-25 02:59:32,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-25 02:59:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 02:59:32,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:32,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:32,442 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 02:59:32,634 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 02:59:32,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:32,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 901599497, now seen corresponding path program 1 times [2023-12-25 02:59:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764865016] [2023-12-25 02:59:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:32,636 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 02:59:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:32,638 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 02:59:32,639 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 02:59:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:32,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 02:59:32,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 02:59:32,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:59:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:59:35,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:59:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764865016] [2023-12-25 02:59:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764865016] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:59:35,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:59:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 02:59:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894828524] [2023-12-25 02:59:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:59:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:59:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:59:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:59:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:59:35,407 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:40,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:59:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:59:40,679 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-25 02:59:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:59:40,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 02:59:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:59:40,694 INFO L225 Difference]: With dead ends: 29 [2023-12-25 02:59:40,694 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 02:59:40,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:59:40,695 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-25 02:59:40,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-25 02:59:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 02:59:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 02:59:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:59:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-25 02:59:40,700 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2023-12-25 02:59:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:59:40,701 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-25 02:59:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-25 02:59:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 02:59:40,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:40,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:40,707 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 02:59:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 02:59:40,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:40,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1808695034, now seen corresponding path program 1 times [2023-12-25 02:59:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673875594] [2023-12-25 02:59:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:40,909 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 02:59:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:40,910 INFO L229 MonitoredProcess]: Starting monitored process 4 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 02:59:40,912 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 (4)] Waiting until timeout for monitored process [2023-12-25 02:59:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:41,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 02:59:41,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 02:59:41,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:59:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:59:57,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:59:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673875594] [2023-12-25 02:59:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673875594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:59:57,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:59:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2023-12-25 02:59:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006724916] [2023-12-25 02:59:57,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:59:57,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 02:59:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:59:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 02:59:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2023-12-25 02:59:57,539 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:00:14,045 WARN L293 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:00:18,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:32,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:36,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:40,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:45,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:49,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:00:50,274 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-25 03:00:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:00:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-12-25 03:00:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:00:50,290 INFO L225 Difference]: With dead ends: 44 [2023-12-25 03:00:50,291 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 03:00:50,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=55, Invalid=214, Unknown=3, NotChecked=0, Total=272 [2023-12-25 03:00:50,292 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2023-12-25 03:00:50,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 30.8s Time] [2023-12-25 03:00:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 03:00:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 03:00:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 03:00:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-12-25 03:00:50,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2023-12-25 03:00:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:00:50,310 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-12-25 03:00:50,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:00:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-12-25 03:00:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 03:00:50,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:00:50,312 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:00:50,321 INFO L552 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 (4)] Ended with exit code 0 [2023-12-25 03:00:50,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:00:50,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:00:50,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:00:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -766834999, now seen corresponding path program 2 times [2023-12-25 03:00:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:00:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635727990] [2023-12-25 03:00:50,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:00:50,526 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:00:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:00:50,527 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:00:50,529 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:00:50,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:00:50,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:00:50,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 03:00:50,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:01:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 03:01:11,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:01:57,895 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2)) (.cse1 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse2))) (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse0 (_ bv1 64) (bvneg .cse1)))) (= (_ bv0 64) (bvadd (bvneg (bvadd .cse0 (_ bv1 64))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2 .cse2) .cse2 (_ bv1 64) (bvneg (bvmul .cse1 .cse2))))))) is different from true [2023-12-25 03:02:06,442 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:02:21,893 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:02:26,812 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1) (_ bv1 64))) (.cse0 (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) .cse1))) (or (= (_ bv0 64) (bvadd (bvneg (bvmul .cse0 .cse1)) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) (bvneg (bvadd (_ bv1 64) (bvmul .cse1 .cse2))) .cse1 (_ bv1 64) (bvmul .cse1 .cse1))) (not (= (_ bv0 64) (bvadd (bvneg .cse2) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) .cse1 (_ bv1 64) (bvneg .cse0))))))) is different from true [2023-12-25 03:02:42,341 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:02:50,706 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:02:56,176 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1)) (.cse3 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1))) (let ((.cse2 (bvadd .cse3 (_ bv1 64))) (.cse0 (bvmul .cse4 .cse1))) (or (= (_ bv0 64) (bvadd (bvneg (bvmul .cse0 .cse1)) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1 .cse1) (bvneg (bvadd (_ bv1 64) (bvmul .cse1 .cse2))) .cse1 (_ bv1 64) (bvmul .cse1 .cse1))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse3 (_ bv1 64) (bvneg .cse4)))) (not (= (_ bv0 64) (bvadd (bvneg .cse2) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1 .cse1) .cse1 (_ bv1 64) (bvneg .cse0)))))))) is different from true [2023-12-25 03:03:13,625 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:03:20,302 WARN L293 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:03:24,419 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul .cse1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse4 (bvmul .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|))) (let ((.cse0 (bvadd (_ bv1 64) .cse4)) (.cse2 (bvmul .cse1 .cse3))) (or (not (= (_ bv0 64) (bvadd (bvneg .cse0) .cse1 (bvmul .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse2)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse3) .cse4)) (= (_ bv0 64) (bvadd (bvmul .cse1 .cse1) (bvneg (bvadd (_ bv1 64) (bvmul .cse1 .cse0))) (bvneg (bvmul .cse1 .cse2)) .cse1 (_ bv1 64) (bvmul .cse1 .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:03:41,478 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:03:49,740 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:04:06,765 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:04:15,829 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul .cse1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse4 (bvmul .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|))) (let ((.cse0 (bvadd (_ bv1 64) .cse4)) (.cse2 (bvmul .cse1 .cse3))) (or (not (= (_ bv0 64) (bvadd (bvneg .cse0) .cse1 (bvmul .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse2)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse3) .cse4)) (= (_ bv0 64) (bvadd (bvmul .cse1 .cse1) (bvneg (bvadd (_ bv1 64) (bvmul .cse1 .cse0))) (bvneg (bvmul .cse1 .cse2)) .cse1 (_ bv1 64) (bvmul .cse1 .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:04:28,745 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:04:37,145 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:04:43,065 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:04:51,584 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:05:00,253 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:05:05,176 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse4 (bvadd (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0) (_ bv1 64))) (.cse5 (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse1 (bvmul .cse5 .cse0)) (.cse2 (bvadd (_ bv1 64) (bvmul .cse0 .cse4))) (.cse3 (bvmul .cse0 .cse0))) (or (= (_ bv0 64) (bvadd (bvneg (bvmul .cse0 .cse1)) (bvneg (bvadd (_ bv1 64) (bvmul .cse0 .cse2))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0 .cse0 .cse0) (bvmul .cse0 .cse0 .cse0) .cse0 (_ bv1 64) .cse3)) (not (= (_ bv0 64) (bvadd (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0) .cse0 (_ bv1 64) (bvneg .cse5)))) (not (= (_ bv0 64) (bvadd (bvneg .cse1) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0 .cse0) (bvneg .cse2) .cse0 (_ bv1 64) .cse3))))))) is different from true [2023-12-25 03:05:21,145 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:05:29,753 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:05:38,398 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:05:45,232 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse2)) (.cse0 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2))) (let ((.cse6 (bvadd .cse0 (_ bv1 64))) (.cse7 (bvmul .cse1 .cse2))) (let ((.cse3 (bvmul .cse7 .cse2)) (.cse4 (bvadd (_ bv1 64) (bvmul .cse2 .cse6))) (.cse5 (bvmul .cse2 .cse2))) (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~x~0#1|) .cse0 (_ bv1 64) (bvneg .cse1)))) (= (_ bv0 64) (bvadd (bvneg (bvmul .cse2 .cse3)) (bvneg (bvadd (_ bv1 64) (bvmul .cse2 .cse4))) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2 .cse2 .cse2 .cse2) (bvmul .cse2 .cse2 .cse2) .cse2 (_ bv1 64) .cse5)) (not (= (_ bv0 64) (bvadd (bvneg .cse6) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2 .cse2) .cse2 (_ bv1 64) (bvneg .cse7)))) (not (= (_ bv0 64) (bvadd (bvneg .cse3) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse2 .cse2 .cse2) (bvneg .cse4) .cse2 (_ bv1 64) .cse5)))))))) is different from true [2023-12-25 03:05:57,909 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:06,348 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:14,896 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:23,495 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:27,651 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17|))) (let ((.cse7 (bvmul .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|)) (.cse6 (bvmul .cse0 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|))) (let ((.cse1 (bvmul .cse0 .cse6)) (.cse2 (bvadd (_ bv1 64) .cse7))) (let ((.cse3 (bvmul .cse0 .cse0)) (.cse5 (bvadd (_ bv1 64) (bvmul .cse0 .cse2))) (.cse4 (bvmul .cse0 .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (_ bv1 64) (bvmul .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse1) (bvneg .cse2)))) (= (bvadd .cse0 .cse3 (bvneg (bvmul .cse0 .cse4)) (bvneg (bvadd (bvmul .cse0 .cse5) (_ bv1 64))) (_ bv1 64) (bvmul .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvmul .cse0 .cse0 .cse0)) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 .cse3 (_ bv1 64) (bvneg .cse5) (bvmul .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse4)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse6) (_ bv1 64) .cse7)))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:06:40,378 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:48,838 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:06:57,371 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:05,958 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:18,727 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:27,167 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:35,708 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:44,295 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:07:48,446 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17|))) (let ((.cse7 (bvmul .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|)) (.cse6 (bvmul .cse0 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|))) (let ((.cse1 (bvmul .cse0 .cse6)) (.cse2 (bvadd (_ bv1 64) .cse7))) (let ((.cse3 (bvmul .cse0 .cse0)) (.cse5 (bvadd (_ bv1 64) (bvmul .cse0 .cse2))) (.cse4 (bvmul .cse0 .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (_ bv1 64) (bvmul .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse1) (bvneg .cse2)))) (= (bvadd .cse0 .cse3 (bvneg (bvmul .cse0 .cse4)) (bvneg (bvadd (bvmul .cse0 .cse5) (_ bv1 64))) (_ bv1 64) (bvmul .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvmul .cse0 .cse0 .cse0)) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 .cse3 (_ bv1 64) (bvneg .cse5) (bvmul .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse4)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse6) (_ bv1 64) .cse7)))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:08:01,756 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:10,322 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:18,877 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:27,572 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:36,258 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:41,941 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:50,652 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:08:57,650 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0)) (.cse5 (bvadd (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0) (_ bv1 64)))) (let ((.cse8 (bvadd (_ bv1 64) (bvmul .cse0 .cse5))) (.cse7 (bvmul .cse6 .cse0))) (let ((.cse2 (bvmul .cse0 .cse7)) (.cse4 (bvadd (_ bv1 64) (bvmul .cse0 .cse8))) (.cse1 (bvmul .cse0 .cse0 .cse0)) (.cse3 (bvmul .cse0 .cse0))) (or (= (_ bv0 64) (bvadd (bvmul .cse0 .cse0 .cse0 .cse0) .cse1 (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0 .cse0 .cse0 .cse0) .cse0 (_ bv1 64) (bvneg (bvmul .cse0 .cse2)) .cse3 (bvneg (bvadd (_ bv1 64) (bvmul .cse4 .cse0))))) (not (= (_ bv0 64) (bvadd (bvneg .cse2) (bvneg .cse4) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0 .cse0 .cse0) .cse1 .cse0 (_ bv1 64) .cse3))) (not (= (_ bv0 64) (bvadd (bvneg .cse5) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0) .cse0 (_ bv1 64) (bvneg .cse6)))) (not (= (_ bv0 64) (bvadd (bvneg .cse7) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0 .cse0 .cse0) (bvneg .cse8) .cse0 (_ bv1 64) .cse3)))))))) is different from true [2023-12-25 03:09:06,355 WARN L293 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:15,063 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:20,295 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:29,050 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:37,765 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:46,514 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:09:51,564 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:10:00,344 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:10:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 37 not checked. [2023-12-25 03:10:00,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:10:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635727990] [2023-12-25 03:10:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635727990] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:10:00,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:10:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2023-12-25 03:10:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340254533] [2023-12-25 03:10:00,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:10:00,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 03:10:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:10:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 03:10:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=262, Unknown=11, NotChecked=410, Total=756 [2023-12-25 03:10:00,501 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-25 03:10:02,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 03:10:12,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:10:16,980 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse9 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17|))) (let ((.cse7 (bvmul .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|)) (.cse6 (bvmul .cse0 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|))) (let ((.cse1 (bvmul .cse0 .cse6)) (.cse2 (bvadd (_ bv1 64) .cse7))) (let ((.cse3 (bvmul .cse0 .cse0)) (.cse5 (bvadd (_ bv1 64) (bvmul .cse0 .cse2))) (.cse4 (bvmul .cse0 .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (_ bv1 64) (bvmul .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse1) (bvneg .cse2)))) (= (bvadd .cse0 .cse3 (bvneg (bvmul .cse0 .cse4)) (bvneg (bvadd (bvmul .cse0 .cse5) (_ bv1 64))) (_ bv1 64) (bvmul .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvmul .cse0 .cse0 .cse0)) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 .cse3 (_ bv1 64) (bvneg .cse5) (bvmul .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse4)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse6) (_ bv1 64) .cse7)))))))) .cse8 .cse9) (= (_ bv1 32) c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16|))) (let ((.cse13 (bvmul .cse11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse14 (bvmul .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|))) (let ((.cse10 (bvadd (_ bv1 64) .cse14)) (.cse12 (bvmul .cse11 .cse13))) (or (not (= (_ bv0 64) (bvadd (bvneg .cse10) .cse11 (bvmul .cse11 .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse12)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse13) .cse14)) (= (_ bv0 64) (bvadd (bvmul .cse11 .cse11) (bvneg (bvadd (_ bv1 64) (bvmul .cse11 .cse10))) (bvneg (bvmul .cse11 .cse12)) .cse11 (_ bv1 64) (bvmul .cse11 .cse11 .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)))))))) .cse8 .cse9))) is different from true [2023-12-25 03:10:21,212 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul .cse1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse4 (bvmul .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|))) (let ((.cse0 (bvadd (_ bv1 64) .cse4)) (.cse2 (bvmul .cse1 .cse3))) (or (not (= (_ bv0 64) (bvadd (bvneg .cse0) .cse1 (bvmul .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse2)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse3) .cse4)) (= (_ bv0 64) (bvadd (bvmul .cse1 .cse1) (bvneg (bvadd (_ bv1 64) (bvmul .cse1 .cse0))) (bvneg (bvmul .cse1 .cse2)) .cse1 (_ bv1 64) (bvmul .cse1 .cse1 .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)))))))) .cse5) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17|))) (let ((.cse13 (bvmul .cse6 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|)) (.cse12 (bvmul .cse6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|))) (let ((.cse7 (bvmul .cse6 .cse12)) (.cse8 (bvadd (_ bv1 64) .cse13))) (let ((.cse9 (bvmul .cse6 .cse6)) (.cse11 (bvadd (_ bv1 64) (bvmul .cse6 .cse8))) (.cse10 (bvmul .cse6 .cse7))) (or (not (= (_ bv0 64) (bvadd .cse6 (_ bv1 64) (bvmul .cse6 .cse6 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse7) (bvneg .cse8)))) (= (bvadd .cse6 .cse9 (bvneg (bvmul .cse6 .cse10)) (bvneg (bvadd (bvmul .cse6 .cse11) (_ bv1 64))) (_ bv1 64) (bvmul .cse6 .cse6 .cse6 .cse6 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvmul .cse6 .cse6 .cse6)) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse6 .cse9 (_ bv1 64) (bvneg .cse11) (bvmul .cse6 .cse6 .cse6 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse10)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse12) (_ bv1 64) .cse13)))))))) .cse5) .cse5)) is different from true [2023-12-25 03:10:57,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:11:14,086 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:11:20,660 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse9 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_17|))) (let ((.cse7 (bvmul .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|)) (.cse6 (bvmul .cse0 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_12|))) (let ((.cse1 (bvmul .cse0 .cse6)) (.cse2 (bvadd (_ bv1 64) .cse7))) (let ((.cse3 (bvmul .cse0 .cse0)) (.cse5 (bvadd (_ bv1 64) (bvmul .cse0 .cse2))) (.cse4 (bvmul .cse0 .cse1))) (or (not (= (_ bv0 64) (bvadd .cse0 (_ bv1 64) (bvmul .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse1) (bvneg .cse2)))) (= (bvadd .cse0 .cse3 (bvneg (bvmul .cse0 .cse4)) (bvneg (bvadd (bvmul .cse0 .cse5) (_ bv1 64))) (_ bv1 64) (bvmul .cse0 .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvmul .cse0 .cse0 .cse0)) (_ bv0 64)) (not (= (_ bv0 64) (bvadd .cse0 .cse3 (_ bv1 64) (bvneg .cse5) (bvmul .cse0 .cse0 .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse4)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_12|) (bvneg .cse6) (_ bv1 64) .cse7)))))))) .cse8 .cse9) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_16|))) (let ((.cse13 (bvmul .cse11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse14 (bvmul .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|))) (let ((.cse10 (bvadd (_ bv1 64) .cse14)) (.cse12 (bvmul .cse11 .cse13))) (or (not (= (_ bv0 64) (bvadd (bvneg .cse10) .cse11 (bvmul .cse11 .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse12)))) (= (_ bv0 64) (bvadd (bvneg |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (_ bv1 64) (bvneg .cse13) .cse14)) (= (_ bv0 64) (bvadd (bvmul .cse11 .cse11) (bvneg (bvadd (_ bv1 64) (bvmul .cse11 .cse10))) (bvneg (bvmul .cse11 .cse12)) .cse11 (_ bv1 64) (bvmul .cse11 .cse11 .cse11 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)))))))) .cse8 .cse9))) is different from true [2023-12-25 03:11:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:11:20,790 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-12-25 03:11:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 03:11:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 46 [2023-12-25 03:11:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:11:20,820 INFO L225 Difference]: With dead ends: 49 [2023-12-25 03:11:20,820 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 03:11:20,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 155.3s TimeCoverageRelationStatistics Valid=93, Invalid=325, Unknown=14, NotChecked=624, Total=1056 [2023-12-25 03:11:20,821 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:11:20,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 240 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 630 Unchecked, 15.2s Time] [2023-12-25 03:11:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 03:11:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-25 03:11:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:11:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-25 03:11:20,829 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 46 [2023-12-25 03:11:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:11:20,829 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-25 03:11:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-25 03:11:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-25 03:11:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 03:11:20,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:11:20,830 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:11:20,848 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:11:21,030 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:11:21,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:11:21,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:11:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1727367848, now seen corresponding path program 1 times [2023-12-25 03:11:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:11:21,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8656521] [2023-12-25 03:11:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:11:21,033 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:11:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:11:21,034 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:11:21,035 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:11:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:11:21,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:11:21,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:11:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-25 03:11:26,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:11:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-25 03:11:32,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:11:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8656521] [2023-12-25 03:11:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8656521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:11:32,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:11:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2023-12-25 03:11:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037665030] [2023-12-25 03:11:32,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:11:32,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 03:11:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:11:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 03:11:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:11:32,350 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 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:11:38,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:11:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:11:40,609 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-12-25 03:11:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:11:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 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 59 [2023-12-25 03:11:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:11:40,611 INFO L225 Difference]: With dead ends: 52 [2023-12-25 03:11:40,612 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 03:11:40,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:11:40,612 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:11:40,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2023-12-25 03:11:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 03:11:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 03:11:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:11:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-25 03:11:40,619 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 59 [2023-12-25 03:11:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:11:40,619 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-25 03:11:40,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 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:11:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-25 03:11:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 03:11:40,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:11:40,626 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:11:40,643 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 03:11:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:11:40,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:11:40,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:11:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2029557161, now seen corresponding path program 3 times [2023-12-25 03:11:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:11:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133012688] [2023-12-25 03:11:40,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:11:40,827 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:11:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:11:40,828 INFO L229 MonitoredProcess]: Starting monitored process 7 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:11:40,830 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 (7)] Waiting until timeout for monitored process Received shutdown request... [2023-12-25 03:14:21,252 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:14:21,282 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 03:14:22,453 WARN L435 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 (7)] Forcibly destroying the process [2023-12-25 03:14:22,475 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-25 03:14:22,476 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:14:22,480 WARN L435 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 (7)] Forcibly destroying the process [2023-12-25 03:14:22,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:14:22,480 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 61 with TraceHistMax 7,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1133012688] and IpTcStrategyModuleCvc4 [1768168024]. [2023-12-25 03:14:22,483 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-25 03:14:22,485 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:14:22,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:14:22 BoogieIcfgContainer [2023-12-25 03:14:22,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:14:22,486 INFO L158 Benchmark]: Toolchain (without parser) took 891092.10ms. Allocated memory is still 335.5MB. Free memory was 284.4MB in the beginning and 155.2MB in the end (delta: 129.2MB). Peak memory consumption was 129.1MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 255.9MB. Free memory was 205.3MB in the beginning and 205.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.99ms. Allocated memory is still 335.5MB. Free memory was 284.4MB in the beginning and 272.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.00ms. Allocated memory is still 335.5MB. Free memory was 272.9MB in the beginning and 271.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 335.5MB. Free memory was 271.4MB in the beginning and 269.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: RCFGBuilder took 417.97ms. Allocated memory is still 335.5MB. Free memory was 269.6MB in the beginning and 257.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,487 INFO L158 Benchmark]: TraceAbstraction took 890410.14ms. Allocated memory is still 335.5MB. Free memory was 257.2MB in the beginning and 155.2MB in the end (delta: 101.9MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. [2023-12-25 03:14:22,489 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 03:14:22,491 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 0 [2023-12-25 03:14:22,504 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 (7)] Forceful destruction successful, exit code 137 [2023-12-25 03:14:22,507 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.15ms. Allocated memory is still 255.9MB. Free memory was 205.3MB in the beginning and 205.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.99ms. Allocated memory is still 335.5MB. Free memory was 284.4MB in the beginning and 272.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.00ms. Allocated memory is still 335.5MB. Free memory was 272.9MB in the beginning and 271.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 335.5MB. Free memory was 271.4MB in the beginning and 269.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 417.97ms. Allocated memory is still 335.5MB. Free memory was 269.6MB in the beginning and 257.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 890410.14ms. Allocated memory is still 335.5MB. Free memory was 257.2MB in the beginning and 155.2MB in the end (delta: 101.9MB). Peak memory consumption was 101.8MB. 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: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 61 with TraceHistMax 7,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1133012688] and IpTcStrategyModuleCvc4 [1768168024]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 890.3s, OverallIterations: 6, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 146.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 58.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 56.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 630 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 87 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 252 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 198.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 579.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 305 ConstructedInterpolants, 6 QuantifiedInterpolants, 3269 SizeOfPredicates, 11 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 312/394 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