/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/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:43:59,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:43:59,840 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 06:43:59,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:43:59,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:43:59,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:43:59,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:43:59,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:43:59,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:43:59,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:43:59,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:43:59,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:43:59,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:43:59,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:43:59,876 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:43:59,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:43:59,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:43:59,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:43:59,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:43:59,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:43:59,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:43:59,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:43:59,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:43:59,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:43:59,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:43:59,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:43:59,879 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:43:59,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:43:59,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:43:59,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:43:59,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:43:59,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:43:59,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:43:59,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:43:59,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:43:59,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:43:59,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:43:59,882 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:43:59,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:43:59,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:43:59,883 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:43:59,883 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 06:44:00,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:44:00,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:44:00,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:44:00,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:44:00,086 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:44:00,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-12-16 06:44:01,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:44:01,173 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:44:01,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-12-16 06:44:01,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef34c60e/9f562948d0d242a5ac9972181753e882/FLAG3aa702732 [2023-12-16 06:44:01,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef34c60e/9f562948d0d242a5ac9972181753e882 [2023-12-16 06:44:01,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:44:01,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:44:01,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:44:01,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:44:01,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:44:01,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1901c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01, skipping insertion in model container [2023-12-16 06:44:01,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,228 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:44:01,346 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2023-12-16 06:44:01,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:44:01,397 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:44:01,408 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2023-12-16 06:44:01,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:44:01,442 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:44:01,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01 WrapperNode [2023-12-16 06:44:01,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:44:01,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:44:01,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:44:01,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:44:01,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,490 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2023-12-16 06:44:01,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:44:01,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:44:01,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:44:01,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:44:01,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,541 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-12-16 06:44:01,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:44:01,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:44:01,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:44:01,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:44:01,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (1/1) ... [2023-12-16 06:44:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:44:01,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:44:01,596 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 06:44:01,607 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 06:44:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:44:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:44:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:44:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 06:44:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:44:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:44:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 06:44:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:44:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 06:44:01,708 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:44:01,709 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:44:01,985 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:44:02,033 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:44:02,034 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-16 06:44:02,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:44:02 BoogieIcfgContainer [2023-12-16 06:44:02,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:44:02,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:44:02,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:44:02,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:44:02,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:44:01" (1/3) ... [2023-12-16 06:44:02,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e18d235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:44:02, skipping insertion in model container [2023-12-16 06:44:02,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:44:01" (2/3) ... [2023-12-16 06:44:02,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e18d235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:44:02, skipping insertion in model container [2023-12-16 06:44:02,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:44:02" (3/3) ... [2023-12-16 06:44:02,042 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2023-12-16 06:44:02,054 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:44:02,054 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:44:02,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:44:02,103 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;@247cc172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:44:02,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:44:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.75) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:44:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 06:44:02,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:02,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:02,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:02,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash -768464033, now seen corresponding path program 1 times [2023-12-16 06:44:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408496789] [2023-12-16 06:44:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:44:02,126 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 06:44:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:02,128 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 06:44:02,130 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 06:44:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:44:02,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:44:02,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:44:02,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:44:02,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:02,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408496789] [2023-12-16 06:44:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408496789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:44:02,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:44:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:44:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319793995] [2023-12-16 06:44:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:44:02,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:44:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:44:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:44:02,238 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.75) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:02,344 INFO L93 Difference]: Finished difference Result 103 states and 180 transitions. [2023-12-16 06:44:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:44:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 06:44:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:02,352 INFO L225 Difference]: With dead ends: 103 [2023-12-16 06:44:02,353 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 06:44:02,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 06:44:02,360 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:44:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 06:44:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2023-12-16 06:44:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:44:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-12-16 06:44:02,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 9 [2023-12-16 06:44:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:02,399 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-12-16 06:44:02,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-12-16 06:44:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 06:44:02,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:02,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:02,406 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 06:44:02,603 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 06:44:02,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:02,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1876649111, now seen corresponding path program 1 times [2023-12-16 06:44:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808980538] [2023-12-16 06:44:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:44:02,606 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 06:44:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:02,607 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 06:44:02,611 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 06:44:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:44:02,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:44:02,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:44:02,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:44:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:44:02,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808980538] [2023-12-16 06:44:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808980538] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:44:02,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:44:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 06:44:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307696197] [2023-12-16 06:44:02,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:44:02,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:44:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:44:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:44:02,684 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:02,963 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2023-12-16 06:44:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:44:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 06:44:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:02,966 INFO L225 Difference]: With dead ends: 182 [2023-12-16 06:44:02,966 INFO L226 Difference]: Without dead ends: 148 [2023-12-16 06:44:02,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:44:02,968 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 225 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:02,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 142 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:44:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-16 06:44:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 40. [2023-12-16 06:44:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:44:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2023-12-16 06:44:02,978 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 10 [2023-12-16 06:44:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:02,978 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2023-12-16 06:44:02,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2023-12-16 06:44:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 06:44:02,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:02,979 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:02,984 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 06:44:03,181 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 06:44:03,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:03,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -212673057, now seen corresponding path program 2 times [2023-12-16 06:44:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325777532] [2023-12-16 06:44:03,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:44:03,183 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 06:44:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:03,184 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 06:44:03,188 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 06:44:03,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:44:03,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:44:03,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:44:03,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 06:44:03,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:44:03,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325777532] [2023-12-16 06:44:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325777532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:44:03,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:44:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:44:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019308499] [2023-12-16 06:44:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:44:03,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 06:44:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:03,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 06:44:03,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 06:44:03,264 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:03,309 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2023-12-16 06:44:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 06:44:03,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 06:44:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:03,312 INFO L225 Difference]: With dead ends: 80 [2023-12-16 06:44:03,312 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 06:44:03,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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 06:44:03,315 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:03,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 56 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:44:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 06:44:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-16 06:44:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2023-12-16 06:44:03,328 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 13 [2023-12-16 06:44:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:03,328 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2023-12-16 06:44:03,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2023-12-16 06:44:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 06:44:03,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:03,329 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:03,335 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 06:44:03,534 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 06:44:03,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:03,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 514848562, now seen corresponding path program 1 times [2023-12-16 06:44:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451337010] [2023-12-16 06:44:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:44:03,536 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 06:44:03,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:03,537 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 06:44:03,537 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 06:44:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:44:03,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:44:03,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:44:03,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:44:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:44:03,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451337010] [2023-12-16 06:44:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451337010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:44:03,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:44:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 06:44:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158684733] [2023-12-16 06:44:03,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:44:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:44:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:44:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:44:03,684 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:04,300 INFO L93 Difference]: Finished difference Result 280 states and 401 transitions. [2023-12-16 06:44:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:44:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 06:44:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:04,302 INFO L225 Difference]: With dead ends: 280 [2023-12-16 06:44:04,302 INFO L226 Difference]: Without dead ends: 241 [2023-12-16 06:44:04,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:44:04,304 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 718 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:04,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 465 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:44:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-16 06:44:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 51. [2023-12-16 06:44:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-12-16 06:44:04,312 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 23 [2023-12-16 06:44:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:04,313 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-12-16 06:44:04,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-12-16 06:44:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 06:44:04,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:04,313 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:04,320 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 (5)] Ended with exit code 0 [2023-12-16 06:44:04,514 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 06:44:04,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:04,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1630436082, now seen corresponding path program 2 times [2023-12-16 06:44:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687542045] [2023-12-16 06:44:04,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:44:04,516 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 06:44:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:04,517 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 06:44:04,526 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 06:44:04,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:44:04,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:44:04,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:44:04,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-16 06:44:04,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:44:04,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687542045] [2023-12-16 06:44:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687542045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:44:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:44:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:44:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817446405] [2023-12-16 06:44:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:44:04,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:44:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:44:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:44:04,579 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:04,617 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2023-12-16 06:44:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:44:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-16 06:44:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:04,623 INFO L225 Difference]: With dead ends: 103 [2023-12-16 06:44:04,623 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 06:44:04,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 06:44:04,624 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:04,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:44:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 06:44:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2023-12-16 06:44:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2023-12-16 06:44:04,639 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 29 [2023-12-16 06:44:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2023-12-16 06:44:04,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2023-12-16 06:44:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 06:44:04,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:04,641 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:04,644 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 06:44:04,843 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 06:44:04,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:04,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -161143044, now seen corresponding path program 1 times [2023-12-16 06:44:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824130399] [2023-12-16 06:44:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:44:04,845 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 06:44:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:04,846 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 06:44:04,847 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 06:44:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:44:04,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 06:44:04,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:44:05,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:44:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:44:05,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824130399] [2023-12-16 06:44:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824130399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:44:05,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:44:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 06:44:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89895029] [2023-12-16 06:44:05,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:44:05,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:44:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:44:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:44:05,340 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:07,651 INFO L93 Difference]: Finished difference Result 522 states and 757 transitions. [2023-12-16 06:44:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 06:44:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-16 06:44:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:07,654 INFO L225 Difference]: With dead ends: 522 [2023-12-16 06:44:07,654 INFO L226 Difference]: Without dead ends: 482 [2023-12-16 06:44:07,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 06:44:07,655 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 2600 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 801 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:07,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 1884 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [801 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 06:44:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-16 06:44:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 64. [2023-12-16 06:44:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2023-12-16 06:44:07,668 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 30 [2023-12-16 06:44:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:07,668 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2023-12-16 06:44:07,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2023-12-16 06:44:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 06:44:07,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:07,669 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:07,681 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 06:44:07,872 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 06:44:07,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:07,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash -876314756, now seen corresponding path program 2 times [2023-12-16 06:44:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532012887] [2023-12-16 06:44:07,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:44:07,873 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 06:44:07,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:07,874 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 06:44:07,892 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 06:44:07,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:44:07,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:44:07,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:44:07,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2023-12-16 06:44:07,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:44:07,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532012887] [2023-12-16 06:44:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532012887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:44:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:44:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:44:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424000593] [2023-12-16 06:44:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:44:07,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 06:44:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:07,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 06:44:07,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 06:44:07,960 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:08,002 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2023-12-16 06:44:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 06:44:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-16 06:44:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:08,003 INFO L225 Difference]: With dead ends: 111 [2023-12-16 06:44:08,003 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 06:44:08,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 06:44:08,004 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:08,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 127 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:44:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 06:44:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2023-12-16 06:44:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-12-16 06:44:08,012 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 42 [2023-12-16 06:44:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:08,012 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-12-16 06:44:08,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-12-16 06:44:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 06:44:08,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:08,013 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:08,017 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 (8)] Ended with exit code 0 [2023-12-16 06:44:08,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:44:08,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:08,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1396857862, now seen corresponding path program 1 times [2023-12-16 06:44:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652034502] [2023-12-16 06:44:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:44:08,218 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 06:44:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:08,219 INFO L229 MonitoredProcess]: Starting monitored process 9 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 06:44:08,221 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 (9)] Waiting until timeout for monitored process [2023-12-16 06:44:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:44:08,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 06:44:08,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:44:08,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:44:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:44:09,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:09,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652034502] [2023-12-16 06:44:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652034502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:44:09,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:44:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-16 06:44:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975359797] [2023-12-16 06:44:09,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:44:09,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 06:44:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 06:44:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 06:44:09,726 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:20,176 INFO L93 Difference]: Finished difference Result 1102 states and 1565 transitions. [2023-12-16 06:44:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-16 06:44:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-16 06:44:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:20,181 INFO L225 Difference]: With dead ends: 1102 [2023-12-16 06:44:20,181 INFO L226 Difference]: Without dead ends: 1058 [2023-12-16 06:44:20,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-16 06:44:20,183 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 9427 mSDsluCounter, 7127 mSDsCounter, 0 mSdLazyCounter, 8982 mSolverCounterSat, 1676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9475 SdHoareTripleChecker+Valid, 7528 SdHoareTripleChecker+Invalid, 10658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1676 IncrementalHoareTripleChecker+Valid, 8982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9475 Valid, 7528 Invalid, 10658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1676 Valid, 8982 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-16 06:44:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-12-16 06:44:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 92. [2023-12-16 06:44:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 06:44:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-12-16 06:44:20,198 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 42 [2023-12-16 06:44:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:20,198 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-12-16 06:44:20,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-12-16 06:44:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 06:44:20,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:44:20,204 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:44:20,212 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 06:44:20,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 06:44:20,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:44:20,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:44:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2027867398, now seen corresponding path program 2 times [2023-12-16 06:44:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:44:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789435071] [2023-12-16 06:44:20,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:44:20,406 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 06:44:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:44:20,406 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:44:20,408 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 (10)] Waiting until timeout for monitored process [2023-12-16 06:44:20,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:44:20,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:44:20,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 06:44:20,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:44:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2023-12-16 06:44:20,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:44:20,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:44:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789435071] [2023-12-16 06:44:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789435071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:44:20,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:44:20,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:44:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170995581] [2023-12-16 06:44:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:44:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 06:44:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:44:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 06:44:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 06:44:20,560 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:44:20,584 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2023-12-16 06:44:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 06:44:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-12-16 06:44:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:44:20,585 INFO L225 Difference]: With dead ends: 100 [2023-12-16 06:44:20,585 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 06:44:20,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 06:44:20,589 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:44:20,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:44:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 06:44:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 06:44:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 06:44:20,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2023-12-16 06:44:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:44:20,590 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 06:44:20,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:44:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 06:44:20,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 06:44:20,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:44:20,598 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 06:44:20,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 06:44:20,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 06:44:20,872 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2023-12-16 06:44:20,872 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2023-12-16 06:44:20,872 INFO L899 garLoopResultBuilder]: For program point elem_exists_returnLabel#1(lines 20 26) no Hoare annotation was computed. [2023-12-16 06:44:20,872 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 65) no Hoare annotation was computed. [2023-12-16 06:44:20,873 INFO L895 garLoopResultBuilder]: At program point L61-3(lines 61 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,873 INFO L899 garLoopResultBuilder]: For program point L61-4(lines 61 65) no Hoare annotation was computed. [2023-12-16 06:44:20,873 INFO L895 garLoopResultBuilder]: At program point L62-3(lines 62 64) the Hoare annotation is: false [2023-12-16 06:44:20,873 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 06:44:20,873 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: false [2023-12-16 06:44:20,873 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-12-16 06:44:20,873 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 55 59) no Hoare annotation was computed. [2023-12-16 06:44:20,873 INFO L895 garLoopResultBuilder]: At program point L55-3(lines 55 59) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (= |ULTIMATE.start_elem_exists_~size#1| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_elem_exists_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L22-4(lines 22 24) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 50) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L47-4(lines 47 50) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L39-3(lines 39 43) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L39-4(lines 39 43) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L56-3(lines 56 58) the Hoare annotation is: false [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: false [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-12-16 06:44:20,874 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 06:44:20,875 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) [2023-12-16 06:44:20,875 INFO L899 garLoopResultBuilder]: For program point L33-4(lines 33 36) no Hoare annotation was computed. [2023-12-16 06:44:20,875 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2023-12-16 06:44:20,875 INFO L895 garLoopResultBuilder]: At program point L51-3(lines 51 60) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))) [2023-12-16 06:44:20,875 INFO L899 garLoopResultBuilder]: For program point L51-4(lines 51 60) no Hoare annotation was computed. [2023-12-16 06:44:20,875 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-16 06:44:20,875 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-16 06:44:20,876 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-16 06:44:20,876 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-16 06:44:20,876 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-16 06:44:20,876 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-16 06:44:20,878 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1] [2023-12-16 06:44:20,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:44:20,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:44:20 BoogieIcfgContainer [2023-12-16 06:44:20,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:44:20,889 INFO L158 Benchmark]: Toolchain (without parser) took 19686.03ms. Allocated memory was 255.9MB in the beginning and 442.5MB in the end (delta: 186.6MB). Free memory was 192.0MB in the beginning and 405.5MB in the end (delta: -213.5MB). Peak memory consumption was 230.9MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,889 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:44:20,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.39ms. Allocated memory is still 255.9MB. Free memory was 191.7MB in the beginning and 179.7MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.71ms. Allocated memory is still 255.9MB. Free memory was 179.4MB in the beginning and 177.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,889 INFO L158 Benchmark]: Boogie Preprocessor took 76.29ms. Allocated memory was 255.9MB in the beginning and 368.1MB in the end (delta: 112.2MB). Free memory was 177.6MB in the beginning and 334.8MB in the end (delta: -157.2MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,890 INFO L158 Benchmark]: RCFGBuilder took 466.15ms. Allocated memory is still 368.1MB. Free memory was 334.8MB in the beginning and 314.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,890 INFO L158 Benchmark]: TraceAbstraction took 18852.55ms. Allocated memory was 368.1MB in the beginning and 442.5MB in the end (delta: 74.4MB). Free memory was 314.3MB in the beginning and 405.5MB in the end (delta: -91.2MB). Peak memory consumption was 240.1MB. Max. memory is 8.0GB. [2023-12-16 06:44:20,892 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.44ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.39ms. Allocated memory is still 255.9MB. Free memory was 191.7MB in the beginning and 179.7MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.71ms. Allocated memory is still 255.9MB. Free memory was 179.4MB in the beginning and 177.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.29ms. Allocated memory was 255.9MB in the beginning and 368.1MB in the end (delta: 112.2MB). Free memory was 177.6MB in the beginning and 334.8MB in the end (delta: -157.2MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * RCFGBuilder took 466.15ms. Allocated memory is still 368.1MB. Free memory was 334.8MB in the beginning and 314.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 18852.55ms. Allocated memory was 368.1MB in the beginning and 442.5MB in the end (delta: 74.4MB). Free memory was 314.3MB in the beginning and 405.5MB in the end (delta: -91.2MB). Peak memory consumption was 240.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 9, TraceHistogramMax: 46, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13176 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13077 mSDsluCounter, 10338 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9435 mSDsCounter, 2748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11895 IncrementalHoareTripleChecker+Invalid, 14643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2748 mSolverCounterUnsat, 903 mSDtfsCounter, 11895 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=8, InterpolantAutomatonStates: 108, 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, 9 MinimizatonAttempts, 1743 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 34 PreInvPairs, 87 NumberOfFragments, 58 HoareAnnotationTreeSize, 34 FormulaSimplifications, 676 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FormulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 264 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 3 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 1405/2043 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((size == 0) && (i == 0)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (n == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2023-12-16 06:44:20,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...