/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_operatoramount_amount25_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 09:04:32,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 09:04:32,808 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 09:04:32,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 09:04:32,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 09:04:32,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 09:04:32,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 09:04:32,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 09:04:32,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 09:04:32,836 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 09:04:32,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 09:04:32,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 09:04:32,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 09:04:32,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 09:04:32,838 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 09:04:32,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 09:04:32,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 09:04:32,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 09:04:32,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 09:04:32,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 09:04:32,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 09:04:32,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 09:04:32,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 09:04:32,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 09:04:32,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 09:04:32,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 09:04:32,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 09:04:32,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 09:04:32,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 09:04:32,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:04:32,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 09:04:32,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 09:04:32,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 09:04:32,851 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 09:04:32,851 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 09:04:33,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 09:04:33,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 09:04:33,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 09:04:33,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 09:04:33,028 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 09:04:33,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-12-24 09:04:34,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 09:04:34,385 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 09:04:34,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-12-24 09:04:34,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0837eeb/d2e7b9da1eef48f796ff9903be82fbbe/FLAG1100228f3 [2023-12-24 09:04:34,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0837eeb/d2e7b9da1eef48f796ff9903be82fbbe [2023-12-24 09:04:34,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 09:04:34,425 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 09:04:34,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 09:04:34,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 09:04:34,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 09:04:34,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db5f914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34, skipping insertion in model container [2023-12-24 09:04:34,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 09:04:34,560 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_operatoramount_amount25_file-90.i[915,928] [2023-12-24 09:04:34,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:04:34,594 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 09:04:34,603 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_operatoramount_amount25_file-90.i[915,928] [2023-12-24 09:04:34,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:04:34,635 INFO L206 MainTranslator]: Completed translation [2023-12-24 09:04:34,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34 WrapperNode [2023-12-24 09:04:34,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 09:04:34,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 09:04:34,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 09:04:34,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 09:04:34,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,685 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-12-24 09:04:34,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 09:04:34,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 09:04:34,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 09:04:34,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 09:04:34,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,720 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 09:04:34,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 09:04:34,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 09:04:34,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 09:04:34,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 09:04:34,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (1/1) ... [2023-12-24 09:04:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:04:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 09:04:34,770 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 09:04:34,779 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 09:04:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 09:04:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 09:04:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 09:04:34,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 09:04:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 09:04:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 09:04:34,850 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 09:04:34,851 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 09:04:34,993 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 09:04:35,031 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 09:04:35,031 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 09:04:35,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:04:35 BoogieIcfgContainer [2023-12-24 09:04:35,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 09:04:35,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 09:04:35,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 09:04:35,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 09:04:35,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:04:34" (1/3) ... [2023-12-24 09:04:35,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ca89c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:04:35, skipping insertion in model container [2023-12-24 09:04:35,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:34" (2/3) ... [2023-12-24 09:04:35,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ca89c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:04:35, skipping insertion in model container [2023-12-24 09:04:35,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:04:35" (3/3) ... [2023-12-24 09:04:35,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2023-12-24 09:04:35,086 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 09:04:35,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 09:04:35,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 09:04:35,133 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;@54be2d63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 09:04:35,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 09:04:35,136 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 09:04:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 09:04:35,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:35,147 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 09:04:35,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:35,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1197207762, now seen corresponding path program 1 times [2023-12-24 09:04:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:35,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785015320] [2023-12-24 09:04:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:35,168 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 09:04:35,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:35,176 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 09:04:35,178 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 09:04:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:35,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 09:04:35,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:35,388 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 09:04:35,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 09:04:35,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:04:35,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785015320] [2023-12-24 09:04:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785015320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 09:04:35,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 09:04:35,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 09:04:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456546598] [2023-12-24 09:04:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:04:35,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 09:04:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:04:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 09:04:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 09:04:35,428 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 09:04:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:04:35,468 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2023-12-24 09:04:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 09:04:35,471 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 09:04:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:04:35,476 INFO L225 Difference]: With dead ends: 87 [2023-12-24 09:04:35,477 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 09:04:35,479 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 09:04:35,482 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 09:04:35,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 09:04:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 09:04:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-24 09:04:35,508 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 09:04:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-12-24 09:04:35,510 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 103 [2023-12-24 09:04:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:04:35,510 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-12-24 09:04:35,510 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 09:04:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-12-24 09:04:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 09:04:35,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:35,512 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 09:04:35,517 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 09:04:35,719 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 09:04:35,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:35,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1966328236, now seen corresponding path program 1 times [2023-12-24 09:04:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689923019] [2023-12-24 09:04:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:35,722 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 09:04:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:35,723 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 09:04:35,743 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 09:04:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:35,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 09:04:35,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:41,521 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 09:04:41,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:04:48,399 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 09:04:48,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:04:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689923019] [2023-12-24 09:04:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689923019] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:04:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:04:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [30] total 40 [2023-12-24 09:04:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491687097] [2023-12-24 09:04:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:04:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 09:04:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:04:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 09:04:48,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-12-24 09:04:48,403 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 09:04:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:04:50,820 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2023-12-24 09:04:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 09:04:50,821 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 09:04:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:04:50,823 INFO L225 Difference]: With dead ends: 79 [2023-12-24 09:04:50,823 INFO L226 Difference]: Without dead ends: 77 [2023-12-24 09:04:50,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 09:04:50,825 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 115 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 09:04:50,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 202 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 09:04:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-24 09:04:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-12-24 09:04:50,839 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 09:04:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-12-24 09:04:50,840 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2023-12-24 09:04:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:04:50,840 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-12-24 09:04:50,841 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 09:04:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-12-24 09:04:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 09:04:50,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:50,842 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 09:04:50,847 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 (3)] Ended with exit code 0 [2023-12-24 09:04:51,050 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 09:04:51,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:51,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -191320874, now seen corresponding path program 1 times [2023-12-24 09:04:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:51,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097207593] [2023-12-24 09:04:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:51,061 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 09:04:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:51,063 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 09:04:51,064 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 09:04:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:51,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 09:04:51,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:51,240 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 09:04:51,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:04:51,332 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 09:04:51,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:04:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097207593] [2023-12-24 09:04:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097207593] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 09:04:51,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 09:04:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-24 09:04:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425420477] [2023-12-24 09:04:51,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 09:04:51,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 09:04:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:04:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 09:04:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 09:04:51,335 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 09:04:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:04:51,769 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2023-12-24 09:04:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 09:04:51,770 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 09:04:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:04:51,778 INFO L225 Difference]: With dead ends: 162 [2023-12-24 09:04:51,778 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 09:04:51,781 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 09:04:51,783 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 09:04:51,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 193 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 09:04:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 09:04:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-12-24 09:04:51,814 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 09:04:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-12-24 09:04:51,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 103 [2023-12-24 09:04:51,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:04:51,819 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-12-24 09:04:51,819 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 09:04:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-12-24 09:04:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 09:04:51,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:51,826 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 09:04:51,835 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 09:04:52,040 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 09:04:52,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:52,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -841647817, now seen corresponding path program 1 times [2023-12-24 09:04:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336279869] [2023-12-24 09:04:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:52,042 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 09:04:52,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:52,045 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 09:04:52,097 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 09:04:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:52,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 09:04:52,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:57,967 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 09:04:57,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:05:06,060 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 09:05:06,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:05:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336279869] [2023-12-24 09:05:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336279869] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:05:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:05:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-12-24 09:05:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768963989] [2023-12-24 09:05:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:05:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 09:05:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:05:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 09:05:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 09:05:06,063 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 09:05:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:05:08,253 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2023-12-24 09:05:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 09:05:08,254 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 09:05:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:05:08,255 INFO L225 Difference]: With dead ends: 106 [2023-12-24 09:05:08,255 INFO L226 Difference]: Without dead ends: 104 [2023-12-24 09:05:08,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=398, Invalid=1954, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 09:05:08,257 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 09:05:08,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 224 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 09:05:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-24 09:05:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2023-12-24 09:05:08,268 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 09:05:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-12-24 09:05:08,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 104 [2023-12-24 09:05:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:05:08,269 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-12-24 09:05:08,269 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 09:05:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-12-24 09:05:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 09:05:08,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:05:08,270 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 09:05:08,286 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 09:05:08,474 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 09:05:08,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:05:08,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:05:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -330901025, now seen corresponding path program 1 times [2023-12-24 09:05:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:05:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684878193] [2023-12-24 09:05:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:05:08,476 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 09:05:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:05:08,477 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 09:05:08,480 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 09:05:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:05:08,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 09:05:08,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:13,631 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 09:05:13,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:05:22,300 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 09:05:22,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:05:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684878193] [2023-12-24 09:05:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684878193] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:05:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:05:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [35] total 47 [2023-12-24 09:05:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950723407] [2023-12-24 09:05:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:05:22,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 09:05:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:05:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 09:05:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 09:05:22,303 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 09:05:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:05:28,347 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2023-12-24 09:05:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 09:05:28,348 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 09:05:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:05:28,349 INFO L225 Difference]: With dead ends: 100 [2023-12-24 09:05:28,349 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 09:05:28,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2023-12-24 09:05:28,351 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 71 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-24 09:05:28,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 144 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-24 09:05:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 09:05:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-12-24 09:05:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 54 states have internal predecessors, (56), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-24 09:05:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2023-12-24 09:05:28,366 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 105 [2023-12-24 09:05:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:05:28,367 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2023-12-24 09:05:28,367 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 09:05:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2023-12-24 09:05:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 09:05:28,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:05:28,368 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 09:05:28,372 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 09:05:28,571 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 09:05:28,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:05:28,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:05:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash -330841443, now seen corresponding path program 1 times [2023-12-24 09:05:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:05:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327876597] [2023-12-24 09:05:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:05:28,573 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 09:05:28,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:05:28,574 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 09:05:28,599 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 09:05:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:05:28,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 09:05:28,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:35,062 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 09:05:35,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:05:45,155 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 09:05:45,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:05:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327876597] [2023-12-24 09:05:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327876597] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:05:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:05:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-12-24 09:05:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079704428] [2023-12-24 09:05:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:05:45,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 09:05:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:05:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 09:05:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 09:05:45,158 INFO L87 Difference]: Start difference. First operand 92 states and 122 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 09:05:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:05:49,648 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2023-12-24 09:05:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 09:05:49,648 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 09:05:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:05:49,649 INFO L225 Difference]: With dead ends: 97 [2023-12-24 09:05:49,649 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 09:05:49,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=409, Invalid=1943, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 09:05:49,653 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 09:05:49,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 160 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 09:05:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 09:05:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 09:05:49,655 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 09:05:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 09:05:49,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2023-12-24 09:05:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:05:49,655 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 09:05:49,657 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 09:05:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 09:05:49,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 09:05:49,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 09:05:49,667 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 09:05:49,864 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 09:05:49,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 09:05:55,993 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-24 09:05:55,994 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 09:05:55,994 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 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-24 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 09:05:55,994 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 09:05:55,994 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 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 09:05:55,994 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-24 09:05:55,995 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-24 09:05:55,995 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 09:05:55,995 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 09:05:55,995 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 47) no Hoare annotation was computed. [2023-12-24 09:05:55,995 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 09:05:55,995 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 09:05:55,995 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 09:05:55,995 INFO L895 garLoopResultBuilder]: At program point L103-2(lines 103 109) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ~var_1_16~0)) (.cse4 ((_ zero_extend 24) ~var_1_15~0))) (let ((.cse3 (bvsle .cse4 (_ bv1 32))) (.cse0 (= .cse10 .cse4)) (.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse5 ((_ 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))))) (.cse6 ((_ sign_extend 24) ~var_1_11~0))) (or (let ((.cse1 (forall ((v_subst_6 (_ BitVec 32)) (v_subst_5 (_ BitVec 32))) (or (not (bvuge (bvadd v_subst_6 (bvneg ~var_1_8~0)) v_subst_5)) (not (bvult .cse5 (bvlshr ~var_1_8~0 v_subst_5))))))) (and (or .cse0 .cse1) (fp.eq ~var_1_18~0 ~var_1_18~0) (or .cse1 .cse2) (not (bvult |ULTIMATE.start_step_~stepLocal_1~0#1| (bvlshr ~var_1_8~0 ~var_1_9~0))) .cse3 (bvsge .cse4 (_ bv1 32)) (or (and .cse0 .cse2) (not (= .cse5 ~last_1_var_1_6~0))) (or (= ~last_1_var_1_6~0 .cse6) (forall ((v_subst_4 (_ BitVec 32))) (not (bvult .cse6 (bvlshr ~var_1_8~0 v_subst_4))))))) (let ((.cse11 (bvmul (_ bv2 32) .cse6))) (let ((.cse7 (bvslt .cse11 .cse6)) (.cse8 ((_ sign_extend 16) ~var_1_1~0)) (.cse9 (= .cse5 .cse6))) (and (or .cse7 (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse6)) .cse8) .cse0 .cse2 .cse9)) .cse3 (bvsge .cse10 (_ bv1 32)) (or (not .cse7) (and .cse0 (= ((_ sign_extend 16) ((_ extract 15 0) .cse11)) .cse8) .cse2 .cse9)))))))) [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L103-3(lines 103 109) no Hoare annotation was computed. [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 09:05:55,996 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 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 65 92) no Hoare annotation was computed. [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-24 09:05:55,996 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 09:05:55,996 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 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 44) no Hoare annotation was computed. [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 39 64) no Hoare annotation was computed. [2023-12-24 09:05:55,996 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 09:05:55,997 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 09:05:55,997 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 09:05:55,997 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 09:05:55,997 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 09:05:55,997 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 63) no Hoare annotation was computed. [2023-12-24 09:05:55,997 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-24 09:05:55,997 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 09:05:55,997 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 09:05:55,997 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 64) no Hoare annotation was computed. [2023-12-24 09:05:55,997 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 09:05:55,997 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 09:05:55,997 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 09:05:55,998 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 09:05:55,998 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 09:05:56,000 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 09:05:56,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 09:05:56,012 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~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_5))) could not be translated [2023-12-24 09:05:56,012 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 09:05:56,012 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~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_5))) could not be translated [2023-12-24 09:05:56,012 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 09:05:56,013 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 09:05:56,013 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_4))) could not be translated [2023-12-24 09:05:56,013 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 09:05:56,014 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-12-24 09:05:56,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:05:56 BoogieIcfgContainer [2023-12-24 09:05:56,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 09:05:56,015 INFO L158 Benchmark]: Toolchain (without parser) took 81589.97ms. Allocated memory was 312.5MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 260.0MB in the beginning and 884.7MB in the end (delta: -624.8MB). Peak memory consumption was 635.6MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,015 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 213.9MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 09:05:56,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.92ms. Allocated memory is still 312.5MB. Free memory was 259.7MB in the beginning and 246.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.26ms. Allocated memory is still 312.5MB. Free memory was 246.6MB in the beginning and 244.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,015 INFO L158 Benchmark]: Boogie Preprocessor took 45.53ms. Allocated memory is still 312.5MB. Free memory was 244.5MB in the beginning and 241.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,016 INFO L158 Benchmark]: RCFGBuilder took 299.20ms. Allocated memory is still 312.5MB. Free memory was 241.9MB in the beginning and 223.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,016 INFO L158 Benchmark]: TraceAbstraction took 80981.33ms. Allocated memory was 312.5MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 222.2MB in the beginning and 884.7MB in the end (delta: -662.5MB). Peak memory consumption was 597.9MB. Max. memory is 8.0GB. [2023-12-24 09:05:56,017 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.13ms. Allocated memory is still 213.9MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.92ms. Allocated memory is still 312.5MB. Free memory was 259.7MB in the beginning and 246.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.26ms. Allocated memory is still 312.5MB. Free memory was 246.6MB in the beginning and 244.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.53ms. Allocated memory is still 312.5MB. Free memory was 244.5MB in the beginning and 241.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.20ms. Allocated memory is still 312.5MB. Free memory was 241.9MB in the beginning and 223.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 80981.33ms. Allocated memory was 312.5MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 222.2MB in the beginning and 884.7MB in the end (delta: -662.5MB). Peak memory consumption was 597.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~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_5))) 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_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~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_5))) 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_4))) 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: 80.9s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 603 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1652 IncrementalHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 381 mSDtfsCounter, 1652 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, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, 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, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 93 PreInvPairs, 130 NumberOfFragments, 413 HoareAnnotationTreeSize, 93 FormulaSimplifications, 6729 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 19 FormulaSimplificationsInter, 23753 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 56.9s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1132 ConstructedInterpolants, 31 QuantifiedInterpolants, 15750 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1048 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: 103]: Loop Invariant Derived loop invariant: ((((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)))) || ((((((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))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 09:05:56,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...