/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_fillercode_fillercodestructure_filler-pe-co_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 12:02:24,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 12:02:24,590 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 12:02:24,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 12:02:24,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 12:02:24,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 12:02:24,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 12:02:24,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 12:02:24,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 12:02:24,625 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 12:02:24,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 12:02:24,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 12:02:24,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 12:02:24,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 12:02:24,626 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 12:02:24,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 12:02:24,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 12:02:24,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 12:02:24,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 12:02:24,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 12:02:24,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 12:02:24,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 12:02:24,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 12:02:24,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 12:02:24,635 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 12:02:24,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 12:02:24,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 12:02:24,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 12:02:24,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:02:24,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 12:02:24,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 12:02:24,638 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 12:02:24,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 12:02:24,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 12:02:24,638 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 12:02:24,638 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 12:02:24,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 12:02:24,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 12:02:24,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 12:02:24,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 12:02:24,809 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 12:02:24,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i [2023-12-16 12:02:25,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 12:02:26,087 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 12:02:26,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i [2023-12-16 12:02:26,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f890037/9cbba51b957045f0980cd314488e32e8/FLAG8edc1ded4 [2023-12-16 12:02:26,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f890037/9cbba51b957045f0980cd314488e32e8 [2023-12-16 12:02:26,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 12:02:26,113 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 12:02:26,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 12:02:26,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 12:02:26,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 12:02:26,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3071a214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26, skipping insertion in model container [2023-12-16 12:02:26,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 12:02:26,250 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_fillercode_fillercodestructure_filler-pe-co_file-52.i[919,932] [2023-12-16 12:02:26,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:02:26,346 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 12:02:26,355 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_fillercode_fillercodestructure_filler-pe-co_file-52.i[919,932] [2023-12-16 12:02:26,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:02:26,432 INFO L206 MainTranslator]: Completed translation [2023-12-16 12:02:26,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26 WrapperNode [2023-12-16 12:02:26,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 12:02:26,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 12:02:26,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 12:02:26,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 12:02:26,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,485 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2023-12-16 12:02:26,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 12:02:26,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 12:02:26,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 12:02:26,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 12:02:26,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,526 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 12:02:26,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 12:02:26,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 12:02:26,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 12:02:26,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 12:02:26,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (1/1) ... [2023-12-16 12:02:26,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:02:26,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 12:02:26,605 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 12:02:26,624 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 12:02:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 12:02:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 12:02:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 12:02:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 12:02:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 12:02:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 12:02:26,703 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 12:02:26,705 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 12:02:27,730 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 12:02:27,782 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 12:02:27,783 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 12:02:27,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:02:27 BoogieIcfgContainer [2023-12-16 12:02:27,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 12:02:27,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 12:02:27,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 12:02:27,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 12:02:27,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:02:26" (1/3) ... [2023-12-16 12:02:27,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:02:27, skipping insertion in model container [2023-12-16 12:02:27,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:02:26" (2/3) ... [2023-12-16 12:02:27,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:02:27, skipping insertion in model container [2023-12-16 12:02:27,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:02:27" (3/3) ... [2023-12-16 12:02:27,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i [2023-12-16 12:02:27,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 12:02:27,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 12:02:27,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 12:02:27,856 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;@2b97496f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 12:02:27,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 12:02:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 12:02:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 12:02:27,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:27,871 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:27,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:27,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1017583937, now seen corresponding path program 1 times [2023-12-16 12:02:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119817282] [2023-12-16 12:02:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:27,885 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 12:02:27,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:27,887 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 12:02:27,901 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 12:02:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:28,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 12:02:28,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-16 12:02:28,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:28,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:28,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119817282] [2023-12-16 12:02:28,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119817282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:28,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:28,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 12:02:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246669501] [2023-12-16 12:02:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:28,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 12:02:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 12:02:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 12:02:28,241 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 12:02:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:28,295 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2023-12-16 12:02:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 12:02:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2023-12-16 12:02:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:28,309 INFO L225 Difference]: With dead ends: 143 [2023-12-16 12:02:28,309 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 12:02:28,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 12:02:28,317 INFO L413 NwaCegarLoop]: 108 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, 108 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 12:02:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 12:02:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 12:02:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-16 12:02:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 12:02:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2023-12-16 12:02:28,355 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 145 [2023-12-16 12:02:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:28,363 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2023-12-16 12:02:28,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 12:02:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2023-12-16 12:02:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 12:02:28,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:28,369 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:28,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 12:02:28,570 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 12:02:28,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:28,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash -406689913, now seen corresponding path program 1 times [2023-12-16 12:02:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401902691] [2023-12-16 12:02:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:28,572 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 12:02:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:28,574 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 12:02:28,582 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 12:02:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:28,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 12:02:28,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 12:02:28,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:28,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:28,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401902691] [2023-12-16 12:02:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401902691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:28,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 12:02:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827137436] [2023-12-16 12:02:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:28,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 12:02:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 12:02:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 12:02:28,872 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:28,939 INFO L93 Difference]: Finished difference Result 140 states and 219 transitions. [2023-12-16 12:02:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:02:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2023-12-16 12:02:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:28,942 INFO L225 Difference]: With dead ends: 140 [2023-12-16 12:02:28,942 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 12:02:28,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 12:02:28,943 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 12:02:28,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 12:02:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 12:02:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-16 12:02:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 12:02:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2023-12-16 12:02:28,951 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 145 [2023-12-16 12:02:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:28,952 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2023-12-16 12:02:28,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2023-12-16 12:02:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 12:02:28,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:28,953 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:28,964 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 12:02:29,162 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 12:02:29,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:29,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -946409725, now seen corresponding path program 1 times [2023-12-16 12:02:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60121994] [2023-12-16 12:02:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:29,165 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 12:02:29,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:29,166 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 12:02:29,167 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 12:02:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:29,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:02:29,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 12:02:29,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:29,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60121994] [2023-12-16 12:02:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60121994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 12:02:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675593094] [2023-12-16 12:02:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:29,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 12:02:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 12:02:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 12:02:29,490 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:29,971 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2023-12-16 12:02:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 12:02:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2023-12-16 12:02:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:29,973 INFO L225 Difference]: With dead ends: 208 [2023-12-16 12:02:29,974 INFO L226 Difference]: Without dead ends: 139 [2023-12-16 12:02:29,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 12:02:29,975 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 101 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 12:02:29,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 368 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 12:02:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-16 12:02:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73. [2023-12-16 12:02:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 12:02:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2023-12-16 12:02:29,983 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 145 [2023-12-16 12:02:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:29,983 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2023-12-16 12:02:29,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2023-12-16 12:02:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 12:02:29,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:29,985 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:29,995 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 12:02:30,195 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 12:02:30,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:30,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1047734981, now seen corresponding path program 1 times [2023-12-16 12:02:30,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:30,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838935586] [2023-12-16 12:02:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:30,199 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 12:02:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:30,200 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 12:02:30,206 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 12:02:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:30,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:02:30,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 12:02:30,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:30,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838935586] [2023-12-16 12:02:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838935586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:30,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 12:02:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682673388] [2023-12-16 12:02:30,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 12:02:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 12:02:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 12:02:30,517 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:31,064 INFO L93 Difference]: Finished difference Result 258 states and 390 transitions. [2023-12-16 12:02:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 12:02:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2023-12-16 12:02:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:31,066 INFO L225 Difference]: With dead ends: 258 [2023-12-16 12:02:31,066 INFO L226 Difference]: Without dead ends: 186 [2023-12-16 12:02:31,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 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 12:02:31,067 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 172 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 12:02:31,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 442 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 12:02:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-16 12:02:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 139. [2023-12-16 12:02:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 12:02:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2023-12-16 12:02:31,083 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 145 [2023-12-16 12:02:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:31,084 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2023-12-16 12:02:31,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2023-12-16 12:02:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 12:02:31,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:31,085 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:31,093 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 12:02:31,293 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 12:02:31,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:31,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -523707899, now seen corresponding path program 1 times [2023-12-16 12:02:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762064019] [2023-12-16 12:02:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:31,294 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 12:02:31,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:31,296 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 12:02:31,312 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 12:02:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:31,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:02:31,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 12:02:31,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:31,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762064019] [2023-12-16 12:02:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762064019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 12:02:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434552425] [2023-12-16 12:02:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:31,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 12:02:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 12:02:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 12:02:31,702 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:31,953 INFO L93 Difference]: Finished difference Result 279 states and 418 transitions. [2023-12-16 12:02:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 12:02:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2023-12-16 12:02:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:31,957 INFO L225 Difference]: With dead ends: 279 [2023-12-16 12:02:31,958 INFO L226 Difference]: Without dead ends: 141 [2023-12-16 12:02:31,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:02:31,959 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:02:31,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 308 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 12:02:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-16 12:02:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2023-12-16 12:02:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 12:02:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2023-12-16 12:02:31,976 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 145 [2023-12-16 12:02:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:31,976 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2023-12-16 12:02:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2023-12-16 12:02:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 12:02:31,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:31,982 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:31,998 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 12:02:32,191 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 12:02:32,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:32,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1548527337, now seen corresponding path program 1 times [2023-12-16 12:02:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670496822] [2023-12-16 12:02:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:32,192 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 12:02:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:32,195 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 12:02:32,197 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 12:02:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:32,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 12:02:32,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 464 proven. 81 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-16 12:02:32,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:02:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 39 proven. 84 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-12-16 12:02:32,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670496822] [2023-12-16 12:02:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670496822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:02:32,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 12:02:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 12:02:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66283988] [2023-12-16 12:02:32,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 12:02:32,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 12:02:32,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:32,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 12:02:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-16 12:02:32,916 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-16 12:02:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:02:33,768 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2023-12-16 12:02:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 12:02:33,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 146 [2023-12-16 12:02:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:02:33,770 INFO L225 Difference]: With dead ends: 208 [2023-12-16 12:02:33,770 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 12:02:33,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2023-12-16 12:02:33,771 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 12:02:33,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 410 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 12:02:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 12:02:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2023-12-16 12:02:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 77 states have (on average 1.155844155844156) internal successors, (89), 77 states have internal predecessors, (89), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 12:02:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2023-12-16 12:02:33,791 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 146 [2023-12-16 12:02:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:02:33,791 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2023-12-16 12:02:33,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-16 12:02:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2023-12-16 12:02:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-16 12:02:33,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:02:33,792 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:33,801 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 12:02:34,000 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 12:02:34,000 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:02:34,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:02:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1809279216, now seen corresponding path program 1 times [2023-12-16 12:02:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:02:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52416253] [2023-12-16 12:02:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:02:34,002 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 12:02:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:02:34,019 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 12:02:34,027 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 12:02:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:02:34,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 12:02:34,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:02:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 12:02:34,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:02:34,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:02:34,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52416253] [2023-12-16 12:02:34,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52416253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:02:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:02:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 12:02:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538932820] [2023-12-16 12:02:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:02:34,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 12:02:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:02:34,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 12:02:34,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 12:02:34,499 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-16 12:02:36,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:37,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:39,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:41,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:43,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:44,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:45,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:47,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:48,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:52,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:53,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:54,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:56,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:58,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:02:59,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:01,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:02,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:03,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:05,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:07,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:09,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:11,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:13,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:14,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:15,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:17,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:19,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:22,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:25,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:33,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:34,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:36,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:38,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:40,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:42,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:03:45,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-16 12:03:45,506 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:03:45,511 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:03:46,523 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 12:03:46,707 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 12:03:46,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 12:03:46,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 12:03:46,714 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 137 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 128 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.5s IncrementalHoareTripleChecker+Time [2023-12-16 12:03:46,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 308 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 70.5s Time] [2023-12-16 12:03:46,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 12:03:46,715 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-16 12:03:46,718 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 12:03:46,720 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 12:03:46,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:03:46 BoogieIcfgContainer [2023-12-16 12:03:46,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 12:03:46,721 INFO L158 Benchmark]: Toolchain (without parser) took 80608.39ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 187.1MB in the beginning and 115.8MB in the end (delta: 71.3MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.81ms. Allocated memory is still 239.1MB. Free memory was 187.1MB in the beginning and 171.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.36ms. Allocated memory is still 239.1MB. Free memory was 171.3MB in the beginning and 168.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: Boogie Preprocessor took 82.19ms. Allocated memory is still 239.1MB. Free memory was 168.7MB in the beginning and 165.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: RCFGBuilder took 1214.10ms. Allocated memory is still 239.1MB. Free memory was 165.1MB in the beginning and 138.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,722 INFO L158 Benchmark]: TraceAbstraction took 78935.32ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 137.8MB in the beginning and 115.8MB in the end (delta: 22.0MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2023-12-16 12:03:46,723 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.14ms. Allocated memory is still 199.2MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.81ms. Allocated memory is still 239.1MB. Free memory was 187.1MB in the beginning and 171.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.36ms. Allocated memory is still 239.1MB. Free memory was 171.3MB in the beginning and 168.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.19ms. Allocated memory is still 239.1MB. Free memory was 168.7MB in the beginning and 165.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1214.10ms. Allocated memory is still 239.1MB. Free memory was 165.1MB in the beginning and 138.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 78935.32ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 137.8MB in the beginning and 115.8MB in the end (delta: 22.0MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.9s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 74.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 689 SdHoareTripleChecker+Valid, 72.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 2107 SdHoareTripleChecker+Invalid, 72.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1164 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 943 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1183 GetRequests, 1134 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 151 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1156 ConstructedInterpolants, 30 QuantifiedInterpolants, 3044 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1760 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 7227/7392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown