/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_amount10_file-92.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:39:03,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:39:03,154 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-16 14:39:03,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:39:03,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:39:03,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:39:03,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:39:03,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:39:03,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:39:03,191 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:39:03,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:39:03,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:39:03,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:39:03,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:39:03,193 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:39:03,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:39:03,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:39:03,194 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:39:03,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:39:03,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:39:03,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:39:03,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:39:03,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:39:03,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:39:03,196 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:39:03,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:39:03,197 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:39:03,197 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:39:03,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:39:03,197 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:39:03,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:39:03,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:39:03,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:39:03,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:39:03,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:39:03,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:39:03,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:39:03,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:39:03,199 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:39:03,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:39:03,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:39:03,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:39:03,204 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:39:03,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:39:03,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:39:03,205 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:39:03,205 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-16 14:39:03,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:39:03,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:39:03,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:39:03,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:39:03,445 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:39:03,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-92.i [2023-12-16 14:39:04,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:39:04,841 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:39:04,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-92.i [2023-12-16 14:39:04,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc21593f/5544767f64744417ade2d782adb5104e/FLAGd71efbca2 [2023-12-16 14:39:04,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc21593f/5544767f64744417ade2d782adb5104e [2023-12-16 14:39:04,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:39:04,863 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:39:04,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:39:04,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:39:04,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:39:04,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:39:04" (1/1) ... [2023-12-16 14:39:04,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749aa051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:04, skipping insertion in model container [2023-12-16 14:39:04,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:39:04" (1/1) ... [2023-12-16 14:39:04,892 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:39:05,034 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_amount10_file-92.i[915,928] [2023-12-16 14:39:05,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:39:05,081 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:39:05,089 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_amount10_file-92.i[915,928] [2023-12-16 14:39:05,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:39:05,113 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:39:05,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05 WrapperNode [2023-12-16 14:39:05,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:39:05,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:39:05,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:39:05,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:39:05,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,152 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2023-12-16 14:39:05,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:39:05,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:39:05,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:39:05,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:39:05,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,172 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-16 14:39:05,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:39:05,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:39:05,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:39:05,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:39:05,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (1/1) ... [2023-12-16 14:39:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:39:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:39:05,229 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-16 14:39:05,250 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-16 14:39:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:39:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:39:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:39:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:39:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:39:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:39:05,339 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:39:05,343 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:39:05,560 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:39:05,626 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:39:05,626 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:39:05,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:39:05 BoogieIcfgContainer [2023-12-16 14:39:05,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:39:05,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:39:05,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:39:05,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:39:05,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:39:04" (1/3) ... [2023-12-16 14:39:05,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697eb7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:39:05, skipping insertion in model container [2023-12-16 14:39:05,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:05" (2/3) ... [2023-12-16 14:39:05,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697eb7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:39:05, skipping insertion in model container [2023-12-16 14:39:05,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:39:05" (3/3) ... [2023-12-16 14:39:05,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-92.i [2023-12-16 14:39:05,657 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:39:05,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:39:05,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:39:05,715 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;@4d1613db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:39:05,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:39:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:39:05,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:05,729 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:39:05,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:05,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1240637461, now seen corresponding path program 1 times [2023-12-16 14:39:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332375719] [2023-12-16 14:39:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:05,751 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-16 14:39:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:05,758 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-16 14:39:05,775 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-16 14:39:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:05,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 14:39:05,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-16 14:39:05,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:05,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:05,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332375719] [2023-12-16 14:39:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332375719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 14:39:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716456357] [2023-12-16 14:39:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:05,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 14:39:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 14:39:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:39:05,966 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:39:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:06,000 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2023-12-16 14:39:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 14:39:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2023-12-16 14:39:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:06,010 INFO L225 Difference]: With dead ends: 59 [2023-12-16 14:39:06,010 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 14:39:06,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-16 14:39:06,015 INFO L413 NwaCegarLoop]: 37 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, 37 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-16 14:39:06,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:39:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 14:39:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 14:39:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2023-12-16 14:39:06,047 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 63 [2023-12-16 14:39:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:06,048 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-12-16 14:39:06,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:39:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2023-12-16 14:39:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:39:06,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:06,053 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:39:06,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:06,256 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-16 14:39:06,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:06,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -829700395, now seen corresponding path program 1 times [2023-12-16 14:39:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:06,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036612097] [2023-12-16 14:39:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:06,258 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-16 14:39:06,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:06,263 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-16 14:39:06,288 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-16 14:39:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:06,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 14:39:06,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:39:08,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:08,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036612097] [2023-12-16 14:39:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036612097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 14:39:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794851987] [2023-12-16 14:39:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:08,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 14:39:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 14:39:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:39:08,301 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:08,492 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-12-16 14:39:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:39:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-16 14:39:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:08,494 INFO L225 Difference]: With dead ends: 60 [2023-12-16 14:39:08,494 INFO L226 Difference]: Without dead ends: 58 [2023-12-16 14:39:08,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:39:08,496 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:08,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 14:39:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-16 14:39:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2023-12-16 14:39:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 14:39:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2023-12-16 14:39:08,515 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 63 [2023-12-16 14:39:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:08,516 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2023-12-16 14:39:08,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2023-12-16 14:39:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:39:08,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:08,519 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:39:08,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:08,725 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-16 14:39:08,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:08,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash -829640813, now seen corresponding path program 1 times [2023-12-16 14:39:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:08,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776927157] [2023-12-16 14:39:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:08,728 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-16 14:39:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:08,729 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-16 14:39:08,731 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-16 14:39:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:08,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 14:39:08,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:39:09,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:09,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776927157] [2023-12-16 14:39:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776927157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:09,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 14:39:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970521393] [2023-12-16 14:39:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 14:39:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 14:39:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:39:09,401 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:09,665 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2023-12-16 14:39:09,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 14:39:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-16 14:39:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:09,668 INFO L225 Difference]: With dead ends: 65 [2023-12-16 14:39:09,668 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 14:39:09,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:39:09,669 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:09,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 14:39:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 14:39:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-16 14:39:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.105263157894737) internal successors, (42), 40 states have internal predecessors, (42), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 14:39:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2023-12-16 14:39:09,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 63 [2023-12-16 14:39:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:09,701 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2023-12-16 14:39:09,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2023-12-16 14:39:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:39:09,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:09,703 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:39:09,715 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-16 14:39:09,909 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-16 14:39:09,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:09,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -772442093, now seen corresponding path program 1 times [2023-12-16 14:39:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455936814] [2023-12-16 14:39:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:09,911 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-16 14:39:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:09,912 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-16 14:39:09,914 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-16 14:39:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:09,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 14:39:09,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:39:10,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:10,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:10,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455936814] [2023-12-16 14:39:10,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455936814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:10,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:10,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 14:39:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913823602] [2023-12-16 14:39:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:10,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 14:39:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:10,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 14:39:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:39:10,975 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:11,042 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-12-16 14:39:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:39:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-16 14:39:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:11,048 INFO L225 Difference]: With dead ends: 68 [2023-12-16 14:39:11,048 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 14:39:11,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:39:11,049 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:11,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:39:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 14:39:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-12-16 14:39:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.1) internal successors, (44), 42 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 14:39:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-12-16 14:39:11,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 63 [2023-12-16 14:39:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:11,067 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-12-16 14:39:11,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-12-16 14:39:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:39:11,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:11,070 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:39:11,077 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-16 14:39:11,277 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-16 14:39:11,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:11,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -772382511, now seen corresponding path program 1 times [2023-12-16 14:39:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113474020] [2023-12-16 14:39:11,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:11,278 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-16 14:39:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:11,279 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-16 14:39:11,280 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-16 14:39:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:11,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 14:39:11,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:39:11,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:11,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:11,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113474020] [2023-12-16 14:39:11,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113474020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:11,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 14:39:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810216689] [2023-12-16 14:39:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:11,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 14:39:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 14:39:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 14:39:11,419 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:11,464 INFO L93 Difference]: Finished difference Result 151 states and 196 transitions. [2023-12-16 14:39:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 14:39:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-16 14:39:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:11,466 INFO L225 Difference]: With dead ends: 151 [2023-12-16 14:39:11,466 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 14:39:11,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:39:11,468 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:11,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:39:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 14:39:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 14:39:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 14:39:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2023-12-16 14:39:11,481 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 63 [2023-12-16 14:39:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:11,482 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2023-12-16 14:39:11,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2023-12-16 14:39:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 14:39:11,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:11,484 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:11,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:11,690 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-16 14:39:11,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:11,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 341161157, now seen corresponding path program 1 times [2023-12-16 14:39:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67952970] [2023-12-16 14:39:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:11,693 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-16 14:39:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:11,697 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-16 14:39:11,700 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-16 14:39:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:11,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 14:39:11,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 420 proven. 1 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-16 14:39:12,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:39:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 14:39:12,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67952970] [2023-12-16 14:39:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67952970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:39:12,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:39:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-16 14:39:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703311523] [2023-12-16 14:39:12,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:39:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 14:39:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 14:39:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 14:39:12,301 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-16 14:39:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:12,471 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2023-12-16 14:39:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:39:12,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 125 [2023-12-16 14:39:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:12,478 INFO L225 Difference]: With dead ends: 175 [2023-12-16 14:39:12,478 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 14:39:12,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:39:12,483 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:12,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 14:39:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 14:39:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2023-12-16 14:39:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 55 states have internal predecessors, (58), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 14:39:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2023-12-16 14:39:12,500 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 125 [2023-12-16 14:39:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:12,501 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2023-12-16 14:39:12,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-16 14:39:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2023-12-16 14:39:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 14:39:12,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:12,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:12,512 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-16 14:39:12,707 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-16 14:39:12,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:12,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash -390806269, now seen corresponding path program 1 times [2023-12-16 14:39:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763100558] [2023-12-16 14:39:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:12,709 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-16 14:39:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:12,710 INFO L229 MonitoredProcess]: Starting monitored process 8 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-16 14:39:12,711 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 (8)] Waiting until timeout for monitored process [2023-12-16 14:39:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:12,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 14:39:12,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 419 proven. 2 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-16 14:39:13,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:39:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 14:39:14,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763100558] [2023-12-16 14:39:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763100558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:39:14,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:39:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-16 14:39:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882348663] [2023-12-16 14:39:14,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:39:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 14:39:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 14:39:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:39:14,281 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-16 14:39:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:14,508 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2023-12-16 14:39:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 14:39:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 125 [2023-12-16 14:39:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:14,509 INFO L225 Difference]: With dead ends: 171 [2023-12-16 14:39:14,510 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:39:14,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-16 14:39:14,513 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:14,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 236 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 14:39:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:39:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:39:14,513 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-16 14:39:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:39:14,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2023-12-16 14:39:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:14,514 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:39:14,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-16 14:39:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:39:14,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:39:14,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:39:14,546 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:14,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 14:39:14,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 39) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L902 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2023-12-16 14:39:14,789 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L899 garLoopResultBuilder]: For program point L32-2(lines 32 34) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L902 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2023-12-16 14:39:14,790 INFO L902 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: true [2023-12-16 14:39:14,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L895 garLoopResultBuilder]: At program point L66-2(lines 66 72) the Hoare annotation is: (or (= ~var_1_2~0 (_ bv0 8)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ~var_1_7~0) (bvneg ((_ zero_extend 24) ~var_1_8~0)) (bvneg ((_ zero_extend 24) ~var_1_9~0)))) ~var_1_6~0) (bvsge (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (bvmul .cse0 .cse0)) (_ bv16 32))) [2023-12-16 14:39:14,790 INFO L899 garLoopResultBuilder]: For program point L66-3(lines 66 72) no Hoare annotation was computed. [2023-12-16 14:39:14,790 INFO L902 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: true [2023-12-16 14:39:14,790 INFO L902 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-16 14:39:14,791 INFO L902 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:39:14,791 INFO L902 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L899 garLoopResultBuilder]: For program point L55(lines 40 56) no Hoare annotation was computed. [2023-12-16 14:39:14,791 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L902 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-16 14:39:14,791 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:39:14,791 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:39:14,792 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:39:14,792 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:39:14,794 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:14,797 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:39:14,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:39:14 BoogieIcfgContainer [2023-12-16 14:39:14,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:39:14,809 INFO L158 Benchmark]: Toolchain (without parser) took 9945.40ms. Allocated memory was 272.6MB in the beginning and 504.4MB in the end (delta: 231.7MB). Free memory was 218.0MB in the beginning and 409.4MB in the end (delta: -191.4MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,810 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:39:14,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 272.6MB. Free memory was 218.0MB in the beginning and 205.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.48ms. Allocated memory is still 272.6MB. Free memory was 205.8MB in the beginning and 204.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,811 INFO L158 Benchmark]: Boogie Preprocessor took 36.37ms. Allocated memory is still 272.6MB. Free memory was 204.1MB in the beginning and 202.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,811 INFO L158 Benchmark]: RCFGBuilder took 437.27ms. Allocated memory is still 272.6MB. Free memory was 201.9MB in the beginning and 186.3MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,811 INFO L158 Benchmark]: TraceAbstraction took 9174.87ms. Allocated memory was 272.6MB in the beginning and 504.4MB in the end (delta: 231.7MB). Free memory was 185.5MB in the beginning and 409.4MB in the end (delta: -223.9MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2023-12-16 14:39:14,813 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.17ms. Allocated memory is still 209.7MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 272.6MB. Free memory was 218.0MB in the beginning and 205.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.48ms. Allocated memory is still 272.6MB. Free memory was 205.8MB in the beginning and 204.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.37ms. Allocated memory is still 272.6MB. Free memory was 204.1MB in the beginning and 202.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 437.27ms. Allocated memory is still 272.6MB. Free memory was 201.9MB in the beginning and 186.3MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9174.87ms. Allocated memory was 272.6MB in the beginning and 504.4MB in the end (delta: 231.7MB). Free memory was 185.5MB in the beginning and 409.4MB in the end (delta: -223.9MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 644 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 327 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=5, InterpolantAutomatonStates: 38, 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, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 113 PreInvPairs, 145 NumberOfFragments, 34 HoareAnnotationTreeSize, 113 FormulaSimplifications, 157 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 806 ConstructedInterpolants, 1 QuantifiedInterpolants, 2257 SizeOfPredicates, 52 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 4019/4024 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: 66]: Loop Invariant Derived loop invariant: (((var_1_2 == 0) || ((((var_1_7 + -(var_1_8)) % 4294967296) & 127) == var_1_6)) || ((var_1_6 * var_1_6) >= 16)) RESULT: Ultimate proved your program to be correct! [2023-12-16 14:39:14,837 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...