/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:03:23,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:03:23,582 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-24 01:03:23,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:03:23,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:03:23,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:03:23,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:03:23,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:03:23,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:03:23,615 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:03:23,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:03:23,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:03:23,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:03:23,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:03:23,622 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:03:23,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:03:23,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:03:23,624 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:03:23,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:03:23,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:03:23,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:03:23,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:03:23,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:03:23,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:03:23,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:03:23,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:03:23,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:03:23,627 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:03:23,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:03:23,627 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:03:23,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:03:23,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:03:23,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:03:23,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:03:23,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:03:23,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:03:23,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:03:23,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:03:23,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:03:23,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:03:23,631 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:03:23,631 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-24 01:03:23,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:03:23,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:03:23,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:03:23,900 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:03:23,900 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:03:23,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-12-24 01:03:25,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:03:25,353 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:03:25,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-12-24 01:03:25,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c382f97/495d5dab02ac468495f316a3e4a5250f/FLAG05e01ff1c [2023-12-24 01:03:25,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c382f97/495d5dab02ac468495f316a3e4a5250f [2023-12-24 01:03:25,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:03:25,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:03:25,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:03:25,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:03:25,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:03:25,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135465e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25, skipping insertion in model container [2023-12-24 01:03:25,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:03:25,583 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-12-24 01:03:25,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:03:25,635 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:03:25,646 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-12-24 01:03:25,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:03:25,677 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:03:25,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25 WrapperNode [2023-12-24 01:03:25,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:03:25,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:03:25,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:03:25,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:03:25,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,729 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-12-24 01:03:25,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:03:25,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:03:25,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:03:25,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:03:25,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,756 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-24 01:03:25,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:03:25,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:03:25,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:03:25,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:03:25,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (1/1) ... [2023-12-24 01:03:25,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:03:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:03:25,820 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-24 01:03:25,856 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-24 01:03:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:03:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:03:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:03:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:03:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:03:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:03:25,964 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:03:25,968 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:03:26,225 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:03:26,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:03:26,297 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:03:26,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:03:26 BoogieIcfgContainer [2023-12-24 01:03:26,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:03:26,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:03:26,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:03:26,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:03:26,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:03:25" (1/3) ... [2023-12-24 01:03:26,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea8ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:03:26, skipping insertion in model container [2023-12-24 01:03:26,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:03:25" (2/3) ... [2023-12-24 01:03:26,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea8ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:03:26, skipping insertion in model container [2023-12-24 01:03:26,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:03:26" (3/3) ... [2023-12-24 01:03:26,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-12-24 01:03:26,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:03:26,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:03:26,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:03:26,380 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;@50be82c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:03:26,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:03:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-24 01:03:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 01:03:26,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:03:26,393 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:03:26,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:03:26,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:03:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash -198418443, now seen corresponding path program 1 times [2023-12-24 01:03:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:03:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221110419] [2023-12-24 01:03:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:03:26,415 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-24 01:03:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:03:26,417 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-24 01:03:26,423 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-24 01:03:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:03:26,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:03:26,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:03:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-12-24 01:03:26,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:03:26,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:03:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221110419] [2023-12-24 01:03:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221110419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:03:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:03:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:03:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655610519] [2023-12-24 01:03:26,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:03:26,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:03:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:03:26,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:03:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:03:26,663 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-24 01:03:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:03:26,719 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2023-12-24 01:03:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:03:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2023-12-24 01:03:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:03:26,728 INFO L225 Difference]: With dead ends: 89 [2023-12-24 01:03:26,729 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 01:03:26,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-24 01:03:26,737 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:03:26,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:03:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 01:03:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-24 01:03:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-24 01:03:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-12-24 01:03:26,786 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 103 [2023-12-24 01:03:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:03:26,786 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-12-24 01:03:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-24 01:03:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-12-24 01:03:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 01:03:26,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:03:26,791 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:03:26,799 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 (2)] Ended with exit code 0 [2023-12-24 01:03:26,996 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-24 01:03:26,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:03:26,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:03:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 933012855, now seen corresponding path program 1 times [2023-12-24 01:03:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:03:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674251065] [2023-12-24 01:03:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:03:26,999 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-24 01:03:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:03:27,000 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-24 01:03:27,040 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-24 01:03:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:03:27,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 01:03:27,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:03:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 382 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-24 01:03:34,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:03:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 01:03:43,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:03:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674251065] [2023-12-24 01:03:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674251065] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:03:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:03:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [30] total 40 [2023-12-24 01:03:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932053537] [2023-12-24 01:03:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:03:43,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 01:03:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:03:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 01:03:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-12-24 01:03:43,230 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:03:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:03:45,912 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2023-12-24 01:03:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 01:03:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2023-12-24 01:03:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:03:45,916 INFO L225 Difference]: With dead ends: 79 [2023-12-24 01:03:45,916 INFO L226 Difference]: Without dead ends: 77 [2023-12-24 01:03:45,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 01:03:45,918 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 115 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:03:45,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 194 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 01:03:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-24 01:03:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-12-24 01:03:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 01:03:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-12-24 01:03:45,937 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2023-12-24 01:03:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:03:45,938 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-12-24 01:03:45,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:03:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-12-24 01:03:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 01:03:45,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:03:45,940 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:03:45,951 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-24 01:03:46,148 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-24 01:03:46,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:03:46,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:03:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1586947079, now seen corresponding path program 1 times [2023-12-24 01:03:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:03:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734168120] [2023-12-24 01:03:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:03:46,151 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-24 01:03:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:03:46,155 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-24 01:03:46,160 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-24 01:03:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:03:46,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 01:03:46,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:03:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 01:03:46,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:03:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 01:03:46,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:03:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734168120] [2023-12-24 01:03:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734168120] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:03:46,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:03:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-24 01:03:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103488661] [2023-12-24 01:03:46,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:03:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:03:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:03:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:03:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 01:03:46,491 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 01:03:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:03:47,028 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2023-12-24 01:03:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 01:03:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 103 [2023-12-24 01:03:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:03:47,031 INFO L225 Difference]: With dead ends: 162 [2023-12-24 01:03:47,031 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 01:03:47,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-12-24 01:03:47,034 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 01:03:47,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 163 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 01:03:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 01:03:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-12-24 01:03:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-24 01:03:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-12-24 01:03:47,055 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 103 [2023-12-24 01:03:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:03:47,056 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-12-24 01:03:47,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 01:03:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-12-24 01:03:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 01:03:47,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:03:47,058 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:03:47,067 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 01:03:47,263 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-24 01:03:47,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:03:47,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:03:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1156444873, now seen corresponding path program 1 times [2023-12-24 01:03:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:03:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945307781] [2023-12-24 01:03:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:03:47,266 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-24 01:03:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:03:47,267 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-24 01:03:47,271 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-24 01:03:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:03:47,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 01:03:47,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:03:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-24 01:03:54,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:04:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 01:04:02,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:04:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945307781] [2023-12-24 01:04:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945307781] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:04:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:04:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-12-24 01:04:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005052897] [2023-12-24 01:04:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:04:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:04:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:04:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:04:02,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 01:04:02,391 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:04:04,669 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2023-12-24 01:04:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 01:04:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2023-12-24 01:04:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:04:04,672 INFO L225 Difference]: With dead ends: 106 [2023-12-24 01:04:04,672 INFO L226 Difference]: Without dead ends: 104 [2023-12-24 01:04:04,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=398, Invalid=1954, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 01:04:04,674 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 156 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:04:04,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 223 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 01:04:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-24 01:04:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2023-12-24 01:04:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-24 01:04:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-12-24 01:04:04,693 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 104 [2023-12-24 01:04:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:04:04,694 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-12-24 01:04:04,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-12-24 01:04:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 01:04:04,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:04:04,696 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:04:04,704 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-24 01:04:04,900 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-24 01:04:04,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:04:04,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:04:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1499673248, now seen corresponding path program 1 times [2023-12-24 01:04:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:04:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492726015] [2023-12-24 01:04:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:04:04,902 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-24 01:04:04,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:04:04,903 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-24 01:04:04,904 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-24 01:04:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:04:05,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 01:04:05,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:04:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-24 01:04:11,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:04:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 01:04:22,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:04:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492726015] [2023-12-24 01:04:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492726015] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:04:22,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:04:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-12-24 01:04:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129057373] [2023-12-24 01:04:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:04:22,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:04:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:04:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:04:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 01:04:22,033 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:04:26,927 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2023-12-24 01:04:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 01:04:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-12-24 01:04:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:04:26,929 INFO L225 Difference]: With dead ends: 91 [2023-12-24 01:04:26,929 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 01:04:26,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=409, Invalid=1943, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 01:04:26,931 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 144 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:04:26,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 162 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-24 01:04:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 01:04:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2023-12-24 01:04:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-24 01:04:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-12-24 01:04:26,966 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 105 [2023-12-24 01:04:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:04:26,972 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-12-24 01:04:26,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-12-24 01:04:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 01:04:26,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:04:26,974 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:04:26,981 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 (6)] Ended with exit code 0 [2023-12-24 01:04:27,174 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-24 01:04:27,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:04:27,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:04:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1499732830, now seen corresponding path program 1 times [2023-12-24 01:04:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:04:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716094919] [2023-12-24 01:04:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:04:27,176 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-24 01:04:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:04:27,179 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-24 01:04:27,179 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 [2023-12-24 01:04:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:04:27,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 01:04:27,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:04:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-24 01:04:32,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:04:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 01:04:41,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:04:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716094919] [2023-12-24 01:04:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716094919] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:04:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:04:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [35] total 47 [2023-12-24 01:04:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909075249] [2023-12-24 01:04:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:04:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 01:04:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:04:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 01:04:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 01:04:41,314 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:04:47,878 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2023-12-24 01:04:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 01:04:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-12-24 01:04:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:04:47,881 INFO L225 Difference]: With dead ends: 97 [2023-12-24 01:04:47,881 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:04:47,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2023-12-24 01:04:47,884 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-24 01:04:47,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 135 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-24 01:04:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:04:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:04:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 01:04:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:04:47,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2023-12-24 01:04:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:04:47,886 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:04:47,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-24 01:04:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:04:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:04:47,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:04:47,895 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 0 [2023-12-24 01:04:48,089 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-24 01:04:48,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:04:53,029 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-24 01:04:53,029 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,029 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,030 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-24 01:04:53,030 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 47) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_15~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 65 92) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 44) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:04:53,031 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 39 64) no Hoare annotation was computed. [2023-12-24 01:04:53,032 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 01:04:53,032 INFO L895 garLoopResultBuilder]: At program point L104-3(lines 104 110) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 24) ~var_1_16~0)) (.cse11 ((_ zero_extend 24) ~var_1_15~0))) (let ((.cse1 ((_ sign_extend 24) ~var_1_11~0)) (.cse6 (bvsle .cse11 (_ bv1 32))) (.cse3 (= .cse7 .cse11)) (.cse4 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse9 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ~var_1_12~0) ((_ sign_extend 24) ~var_1_13~0) (_ bv4294967246 32) ((_ sign_extend 24) ~var_1_14~0)))))) (or (let ((.cse8 (bvmul (_ bv2 32) .cse1))) (let ((.cse0 (bvslt .cse8 .cse1)) (.cse2 ((_ sign_extend 16) ~var_1_1~0)) (.cse5 (= .cse9 .cse1))) (and (or .cse0 (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse1)) .cse2) .cse3 .cse4 .cse5)) .cse6 (bvsge .cse7 (_ bv1 32)) (or (not .cse0) (and .cse3 (= ((_ sign_extend 16) ((_ extract 15 0) .cse8)) .cse2) .cse4 .cse5))))) (let ((.cse10 (forall ((v_subst_13 (_ BitVec 32))) (not (bvult .cse9 (bvlshr ~var_1_8~0 v_subst_13)))))) (and (or .cse10 .cse3) (or (= ~last_1_var_1_6~0 .cse1) (forall ((v_subst_9 (_ BitVec 32)) (v_subst_8 (_ BitVec 32))) (or (not (bvuge (bvadd v_subst_9 (bvneg ~var_1_8~0)) v_subst_8)) (not (bvult .cse1 (bvlshr ~var_1_8~0 v_subst_8)))))) (fp.eq ~var_1_18~0 ~var_1_18~0) (not (bvult |ULTIMATE.start_step_~stepLocal_1~0#1| (bvlshr ~var_1_8~0 ~var_1_9~0))) .cse6 (or .cse10 .cse4) (bvsge .cse11 (_ bv1 32)) (or (and .cse3 .cse4) (not (= .cse9 ~last_1_var_1_6~0)))))))) [2023-12-24 01:04:53,032 INFO L899 garLoopResultBuilder]: For program point L104-4(lines 104 110) no Hoare annotation was computed. [2023-12-24 01:04:53,032 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,032 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,032 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,033 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (bvsge ((_ zero_extend 24) ~var_1_16~0) (_ bv1 32)))) [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 63) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,033 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 64) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:04:53,033 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:04:53,036 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 01:04:53,037 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:04:53,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 01:04:53,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 01:04:53,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_13 : bv32 :: !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_13))) could not be translated [2023-12-24 01:04:53,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_9 : bv32, v_subst_8 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_9, ~bvneg~32(~var_1_8~0)), v_subst_8) || !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_8))) could not be translated [2023-12-24 01:04:53,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 01:04:53,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_13 : bv32 :: !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_13))) could not be translated [2023-12-24 01:04:53,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 01:04:53,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 01:04:53,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:04:53 BoogieIcfgContainer [2023-12-24 01:04:53,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:04:53,054 INFO L158 Benchmark]: Toolchain (without parser) took 87669.34ms. Allocated memory was 286.3MB in the beginning and 987.8MB in the end (delta: 701.5MB). Free memory was 233.7MB in the beginning and 593.8MB in the end (delta: -360.1MB). Peak memory consumption was 583.2MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,054 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 190.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:04:53,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.09ms. Allocated memory is still 286.3MB. Free memory was 233.7MB in the beginning and 220.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.17ms. Allocated memory is still 286.3MB. Free memory was 220.6MB in the beginning and 218.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,055 INFO L158 Benchmark]: Boogie Preprocessor took 38.78ms. Allocated memory is still 286.3MB. Free memory was 218.5MB in the beginning and 215.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,055 INFO L158 Benchmark]: RCFGBuilder took 525.37ms. Allocated memory is still 286.3MB. Free memory was 215.9MB in the beginning and 196.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,055 INFO L158 Benchmark]: TraceAbstraction took 86753.62ms. Allocated memory was 286.3MB in the beginning and 987.8MB in the end (delta: 701.5MB). Free memory was 195.4MB in the beginning and 593.8MB in the end (delta: -398.3MB). Peak memory consumption was 545.5MB. Max. memory is 8.0GB. [2023-12-24 01:04:53,056 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.19ms. Allocated memory is still 190.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.09ms. Allocated memory is still 286.3MB. Free memory was 233.7MB in the beginning and 220.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.17ms. Allocated memory is still 286.3MB. Free memory was 220.6MB in the beginning and 218.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.78ms. Allocated memory is still 286.3MB. Free memory was 218.5MB in the beginning and 215.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.37ms. Allocated memory is still 286.3MB. Free memory was 215.9MB in the beginning and 196.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 86753.62ms. Allocated memory was 286.3MB in the beginning and 987.8MB in the end (delta: 701.5MB). Free memory was 195.4MB in the beginning and 593.8MB in the end (delta: -398.3MB). Peak memory consumption was 545.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_13 : bv32 :: !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_13))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_9 : bv32, v_subst_8 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_9, ~bvneg~32(~var_1_8~0)), v_subst_8) || !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_8))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_13 : bv32 :: !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_13))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.7s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 938 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1637 IncrementalHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 374 mSDtfsCounter, 1637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1172 GetRequests, 958 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=3, InterpolantAutomatonStates: 74, 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, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 93 PreInvPairs, 129 NumberOfFragments, 405 HoareAnnotationTreeSize, 93 FormulaSimplifications, 5311 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FormulaSimplificationsInter, 25920 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 62.4s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1132 ConstructedInterpolants, 31 QuantifiedInterpolants, 15750 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1060 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 5774/5984 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((2 * var_1_11) < var_1_11) || ((((var_1_11 & 32767) == var_1_1) && (var_1_16 == var_1_15)) && ((((var_1_12 + var_1_13) % 4294967296) & 127) == var_1_11))) && (var_1_15 <= 1)) && (var_1_16 >= 1)) && (!(((2 * var_1_11) < var_1_11)) || (((var_1_16 == var_1_15) && (((2 * var_1_11) & 32767) == var_1_1)) && ((((var_1_12 + var_1_13) % 4294967296) & 127) == var_1_11)))) || (((var_1_15 <= 1) && (var_1_15 >= 1)) && ((var_1_16 == var_1_15) || !(((((var_1_12 + var_1_13) % 4294967296) & 127) == last_1_var_1_6))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 01:04:53,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...