/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/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:09:47,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:09:47,968 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-25 07:09:47,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:09:47,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:09:47,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:09:47,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:09:47,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:09:47,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:09:48,001 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:09:48,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:09:48,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:09:48,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:09:48,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:09:48,002 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:09:48,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:09:48,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:09:48,003 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:09:48,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:09:48,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:09:48,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:09:48,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:09:48,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:09:48,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:09:48,005 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:09:48,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:09:48,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:09:48,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:09:48,007 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:09:48,007 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:09:48,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:09:48,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:09:48,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:09:48,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:09:48,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:09:48,008 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:09:48,008 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-25 07:09:48,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:09:48,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:09:48,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:09:48,198 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:09:48,199 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:09:48,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2023-12-25 07:09:49,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:09:49,306 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:09:49,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2023-12-25 07:09:49,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24f00013/eda60f150374465ea8804bbb3a39f683/FLAG1e9d0cfd8 [2023-12-25 07:09:49,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24f00013/eda60f150374465ea8804bbb3a39f683 [2023-12-25 07:09:49,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:09:49,326 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:09:49,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:09:49,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:09:49,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:09:49,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd537c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49, skipping insertion in model container [2023-12-25 07:09:49,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:09:49,441 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c[636,649] [2023-12-25 07:09:49,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:09:49,498 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:09:49,506 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c[636,649] [2023-12-25 07:09:49,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:09:49,547 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:09:49,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49 WrapperNode [2023-12-25 07:09:49,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:09:49,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:09:49,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:09:49,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:09:49,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,582 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 301 [2023-12-25 07:09:49,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:09:49,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:09:49,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:09:49,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:09:49,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:09:49,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:09:49,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:09:49,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:09:49,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:09:49,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (1/1) ... [2023-12-25 07:09:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:09:49,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:09:49,639 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-25 07:09:49,655 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-25 07:09:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:09:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-25 07:09:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-25 07:09:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-25 07:09:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-25 07:09:49,671 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-25 07:09:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:09:49,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:09:49,743 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:09:49,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:09:49,968 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:09:50,039 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:09:50,039 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-25 07:09:50,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:09:50 BoogieIcfgContainer [2023-12-25 07:09:50,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:09:50,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:09:50,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:09:50,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:09:50,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:09:49" (1/3) ... [2023-12-25 07:09:50,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e411a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:09:50, skipping insertion in model container [2023-12-25 07:09:50,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:09:49" (2/3) ... [2023-12-25 07:09:50,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e411a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:09:50, skipping insertion in model container [2023-12-25 07:09:50,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:09:50" (3/3) ... [2023-12-25 07:09:50,045 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2023-12-25 07:09:50,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:09:50,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:09:50,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:09:50,104 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;@37d16681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:09:50,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:09:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 98 states have internal predecessors, (149), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 07:09:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:09:50,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:50,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:50,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:50,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash 545397817, now seen corresponding path program 1 times [2023-12-25 07:09:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186670984] [2023-12-25 07:09:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:50,138 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-25 07:09:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:50,154 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-25 07:09:50,190 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-25 07:09:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:50,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:50,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:50,302 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-25 07:09:50,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:50,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186670984] [2023-12-25 07:09:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186670984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:09:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983437018] [2023-12-25 07:09:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:50,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:50,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:50,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:50,335 INFO L87 Difference]: Start difference. First operand has 121 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 98 states have internal predecessors, (149), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:50,411 INFO L93 Difference]: Finished difference Result 236 states and 365 transitions. [2023-12-25 07:09:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-25 07:09:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:50,420 INFO L225 Difference]: With dead ends: 236 [2023-12-25 07:09:50,420 INFO L226 Difference]: Without dead ends: 117 [2023-12-25 07:09:50,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-25 07:09:50,426 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:50,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 161 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-25 07:09:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-25 07:09:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 95 states have internal predecessors, (137), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 07:09:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-12-25 07:09:50,478 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 52 [2023-12-25 07:09:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:50,480 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-12-25 07:09:50,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-12-25 07:09:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:09:50,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:50,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:50,495 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-25 07:09:50,687 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-25 07:09:50,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:50,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 898486199, now seen corresponding path program 1 times [2023-12-25 07:09:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925375652] [2023-12-25 07:09:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:50,689 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-25 07:09:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:50,690 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-25 07:09:50,699 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-25 07:09:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:50,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:50,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:50,783 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-25 07:09:50,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:50,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925375652] [2023-12-25 07:09:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925375652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:50,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:09:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818594491] [2023-12-25 07:09:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:50,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:50,785 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:50,830 INFO L93 Difference]: Finished difference Result 331 states and 485 transitions. [2023-12-25 07:09:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-25 07:09:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:50,833 INFO L225 Difference]: With dead ends: 331 [2023-12-25 07:09:50,833 INFO L226 Difference]: Without dead ends: 224 [2023-12-25 07:09:50,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-25 07:09:50,835 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 126 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:50,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 329 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-25 07:09:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2023-12-25 07:09:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 175 states have (on average 1.48) internal successors, (259), 179 states have internal predecessors, (259), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (31), 27 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-25 07:09:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2023-12-25 07:09:50,851 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 52 [2023-12-25 07:09:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2023-12-25 07:09:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2023-12-25 07:09:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:09:50,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:50,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:50,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 07:09:51,060 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-25 07:09:51,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:51,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1421806870, now seen corresponding path program 1 times [2023-12-25 07:09:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371483497] [2023-12-25 07:09:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:51,063 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-25 07:09:51,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:51,074 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-25 07:09:51,076 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-25 07:09:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:51,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:51,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:51,160 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-25 07:09:51,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:51,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371483497] [2023-12-25 07:09:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371483497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254527465] [2023-12-25 07:09:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:51,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:09:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:09:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:51,166 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:51,234 INFO L93 Difference]: Finished difference Result 445 states and 669 transitions. [2023-12-25 07:09:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:09:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-25 07:09:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:51,237 INFO L225 Difference]: With dead ends: 445 [2023-12-25 07:09:51,237 INFO L226 Difference]: Without dead ends: 236 [2023-12-25 07:09:51,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:51,241 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 23 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:51,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 531 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-25 07:09:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2023-12-25 07:09:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 181 states have internal predecessors, (260), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (31), 27 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-25 07:09:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 321 transitions. [2023-12-25 07:09:51,275 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 321 transitions. Word has length 52 [2023-12-25 07:09:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:51,275 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 321 transitions. [2023-12-25 07:09:51,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 321 transitions. [2023-12-25 07:09:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:09:51,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:51,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:51,284 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 (4)] Ended with exit code 0 [2023-12-25 07:09:51,479 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-25 07:09:51,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:51,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 577801368, now seen corresponding path program 1 times [2023-12-25 07:09:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805404349] [2023-12-25 07:09:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:51,485 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-25 07:09:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:51,486 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-25 07:09:51,487 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-25 07:09:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:51,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:51,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:51,567 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-25 07:09:51,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:51,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805404349] [2023-12-25 07:09:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805404349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851307874] [2023-12-25 07:09:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:09:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:09:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:51,569 INFO L87 Difference]: Start difference. First operand 220 states and 321 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:51,615 INFO L93 Difference]: Finished difference Result 455 states and 683 transitions. [2023-12-25 07:09:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:09:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-25 07:09:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:51,619 INFO L225 Difference]: With dead ends: 455 [2023-12-25 07:09:51,619 INFO L226 Difference]: Without dead ends: 244 [2023-12-25 07:09:51,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:51,623 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 15 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:51,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 475 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-25 07:09:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 224. [2023-12-25 07:09:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 181 states have (on average 1.4585635359116023) internal successors, (264), 185 states have internal predecessors, (264), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (31), 27 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-25 07:09:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 325 transitions. [2023-12-25 07:09:51,654 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 325 transitions. Word has length 52 [2023-12-25 07:09:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:51,655 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 325 transitions. [2023-12-25 07:09:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 325 transitions. [2023-12-25 07:09:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:09:51,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:51,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:51,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:51,859 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-25 07:09:51,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:51,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 600433622, now seen corresponding path program 1 times [2023-12-25 07:09:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512887506] [2023-12-25 07:09:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:51,862 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-25 07:09:51,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:51,863 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-25 07:09:51,884 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-25 07:09:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:51,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:51,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:51,946 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-25 07:09:51,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:51,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512887506] [2023-12-25 07:09:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512887506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:51,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:51,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:09:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181509005] [2023-12-25 07:09:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:51,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:51,948 INFO L87 Difference]: Start difference. First operand 224 states and 325 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:52,000 INFO L93 Difference]: Finished difference Result 644 states and 936 transitions. [2023-12-25 07:09:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:52,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-25 07:09:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:52,003 INFO L225 Difference]: With dead ends: 644 [2023-12-25 07:09:52,003 INFO L226 Difference]: Without dead ends: 429 [2023-12-25 07:09:52,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-25 07:09:52,004 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 133 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:52,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 319 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-25 07:09:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 410. [2023-12-25 07:09:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 333 states have (on average 1.4264264264264264) internal successors, (475), 338 states have internal predecessors, (475), 52 states have call successors, (52), 25 states have call predecessors, (52), 24 states have return successors, (56), 48 states have call predecessors, (56), 49 states have call successors, (56) [2023-12-25 07:09:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 583 transitions. [2023-12-25 07:09:52,024 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 583 transitions. Word has length 52 [2023-12-25 07:09:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:52,024 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 583 transitions. [2023-12-25 07:09:52,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 583 transitions. [2023-12-25 07:09:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 07:09:52,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:52,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:52,027 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-25 07:09:52,227 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-25 07:09:52,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:52,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1825380819, now seen corresponding path program 1 times [2023-12-25 07:09:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761219924] [2023-12-25 07:09:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:52,229 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-25 07:09:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:52,230 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-25 07:09:52,231 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-25 07:09:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:52,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:52,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:52,311 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-25 07:09:52,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:52,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761219924] [2023-12-25 07:09:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761219924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408216952] [2023-12-25 07:09:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:52,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:09:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:09:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:52,313 INFO L87 Difference]: Start difference. First operand 410 states and 583 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:52,355 INFO L93 Difference]: Finished difference Result 819 states and 1188 transitions. [2023-12-25 07:09:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:09:52,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2023-12-25 07:09:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:52,358 INFO L225 Difference]: With dead ends: 819 [2023-12-25 07:09:52,358 INFO L226 Difference]: Without dead ends: 418 [2023-12-25 07:09:52,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:52,359 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:52,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 483 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-12-25 07:09:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2023-12-25 07:09:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 337 states have (on average 1.4154302670623145) internal successors, (477), 342 states have internal predecessors, (477), 52 states have call successors, (52), 25 states have call predecessors, (52), 24 states have return successors, (56), 48 states have call predecessors, (56), 49 states have call successors, (56) [2023-12-25 07:09:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 585 transitions. [2023-12-25 07:09:52,379 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 585 transitions. Word has length 53 [2023-12-25 07:09:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:52,379 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 585 transitions. [2023-12-25 07:09:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 585 transitions. [2023-12-25 07:09:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 07:09:52,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:52,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:52,396 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 (7)] Ended with exit code 0 [2023-12-25 07:09:52,582 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-25 07:09:52,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:52,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1684832209, now seen corresponding path program 1 times [2023-12-25 07:09:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954971887] [2023-12-25 07:09:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:52,584 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-25 07:09:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:52,585 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-25 07:09:52,586 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-25 07:09:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:52,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:52,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:52,753 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-25 07:09:52,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:52,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954971887] [2023-12-25 07:09:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954971887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4349987] [2023-12-25 07:09:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:52,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:09:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:09:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:09:52,755 INFO L87 Difference]: Start difference. First operand 414 states and 585 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 07:09:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:52,891 INFO L93 Difference]: Finished difference Result 1193 states and 1683 transitions. [2023-12-25 07:09:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:09:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2023-12-25 07:09:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:52,897 INFO L225 Difference]: With dead ends: 1193 [2023-12-25 07:09:52,897 INFO L226 Difference]: Without dead ends: 790 [2023-12-25 07:09:52,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:09:52,899 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 102 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:52,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 619 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:09:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-12-25 07:09:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 774. [2023-12-25 07:09:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 633 states have (on average 1.4075829383886256) internal successors, (891), 646 states have internal predecessors, (891), 92 states have call successors, (92), 49 states have call predecessors, (92), 48 states have return successors, (100), 80 states have call predecessors, (100), 89 states have call successors, (100) [2023-12-25 07:09:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1083 transitions. [2023-12-25 07:09:52,938 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1083 transitions. Word has length 53 [2023-12-25 07:09:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:52,938 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1083 transitions. [2023-12-25 07:09:52,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 07:09:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1083 transitions. [2023-12-25 07:09:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 07:09:52,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:52,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:52,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:53,141 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-25 07:09:53,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:53,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash -657803255, now seen corresponding path program 1 times [2023-12-25 07:09:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967165962] [2023-12-25 07:09:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:53,143 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-25 07:09:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:53,145 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-25 07:09:53,150 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-25 07:09:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:53,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:09:53,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:09:53,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:09:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:09:53,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967165962] [2023-12-25 07:09:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967165962] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:09:53,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:09:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-25 07:09:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398215238] [2023-12-25 07:09:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:53,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:09:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:09:53,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:09:53,346 INFO L87 Difference]: Start difference. First operand 774 states and 1083 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:09:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:53,566 INFO L93 Difference]: Finished difference Result 2327 states and 3264 transitions. [2023-12-25 07:09:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:09:53,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2023-12-25 07:09:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:53,574 INFO L225 Difference]: With dead ends: 2327 [2023-12-25 07:09:53,574 INFO L226 Difference]: Without dead ends: 1564 [2023-12-25 07:09:53,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:09:53,579 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 275 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:53,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1096 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:09:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2023-12-25 07:09:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1534. [2023-12-25 07:09:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1261 states have (on average 1.4044409199048373) internal successors, (1771), 1284 states have internal predecessors, (1771), 176 states have call successors, (176), 97 states have call predecessors, (176), 96 states have return successors, (194), 154 states have call predecessors, (194), 173 states have call successors, (194) [2023-12-25 07:09:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2141 transitions. [2023-12-25 07:09:53,648 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2141 transitions. Word has length 64 [2023-12-25 07:09:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:53,649 INFO L495 AbstractCegarLoop]: Abstraction has 1534 states and 2141 transitions. [2023-12-25 07:09:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:09:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2141 transitions. [2023-12-25 07:09:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-25 07:09:53,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:53,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:53,680 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-25 07:09:53,880 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-25 07:09:53,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:53,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -953398761, now seen corresponding path program 1 times [2023-12-25 07:09:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45065969] [2023-12-25 07:09:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:53,881 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-25 07:09:53,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:53,884 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-25 07:09:53,884 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-25 07:09:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:53,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:53,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:53,986 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-25 07:09:53,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:53,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45065969] [2023-12-25 07:09:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45065969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585595265] [2023-12-25 07:09:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:09:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:09:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:53,988 INFO L87 Difference]: Start difference. First operand 1534 states and 2141 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:54,208 INFO L93 Difference]: Finished difference Result 4594 states and 6471 transitions. [2023-12-25 07:09:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:09:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2023-12-25 07:09:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:54,219 INFO L225 Difference]: With dead ends: 4594 [2023-12-25 07:09:54,219 INFO L226 Difference]: Without dead ends: 3071 [2023-12-25 07:09:54,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-25 07:09:54,223 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 169 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:54,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 443 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:09:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2023-12-25 07:09:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3004. [2023-12-25 07:09:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2487 states have (on average 1.3743466023321271) internal successors, (3418), 2531 states have internal predecessors, (3418), 316 states have call successors, (316), 185 states have call predecessors, (316), 200 states have return successors, (461), 291 states have call predecessors, (461), 313 states have call successors, (461) [2023-12-25 07:09:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 4195 transitions. [2023-12-25 07:09:54,382 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 4195 transitions. Word has length 67 [2023-12-25 07:09:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:54,383 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 4195 transitions. [2023-12-25 07:09:54,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4195 transitions. [2023-12-25 07:09:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-25 07:09:54,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:54,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:54,389 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-25 07:09:54,587 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-25 07:09:54,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:54,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1008175897, now seen corresponding path program 1 times [2023-12-25 07:09:54,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:54,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552843940] [2023-12-25 07:09:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:54,588 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-25 07:09:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:54,589 INFO L229 MonitoredProcess]: Starting monitored process 11 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-25 07:09:54,604 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 (11)] Waiting until timeout for monitored process [2023-12-25 07:09:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:54,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:54,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:54,653 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-25 07:09:54,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:54,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552843940] [2023-12-25 07:09:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552843940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:09:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037592935] [2023-12-25 07:09:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:54,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:54,655 INFO L87 Difference]: Start difference. First operand 3004 states and 4195 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:54,773 INFO L93 Difference]: Finished difference Result 5993 states and 8361 transitions. [2023-12-25 07:09:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2023-12-25 07:09:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:54,783 INFO L225 Difference]: With dead ends: 5993 [2023-12-25 07:09:54,783 INFO L226 Difference]: Without dead ends: 2998 [2023-12-25 07:09:54,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-25 07:09:54,790 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:54,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 159 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2023-12-25 07:09:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2023-12-25 07:09:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2485 states have (on average 1.3738430583501007) internal successors, (3414), 2528 states have internal predecessors, (3414), 312 states have call successors, (312), 185 states have call predecessors, (312), 200 states have return successors, (454), 286 states have call predecessors, (454), 309 states have call successors, (454) [2023-12-25 07:09:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4180 transitions. [2023-12-25 07:09:54,931 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4180 transitions. Word has length 67 [2023-12-25 07:09:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:54,931 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 4180 transitions. [2023-12-25 07:09:54,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4180 transitions. [2023-12-25 07:09:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-25 07:09:54,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:54,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:54,937 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-25 07:09:55,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:55,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1085136470, now seen corresponding path program 1 times [2023-12-25 07:09:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622952706] [2023-12-25 07:09:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:55,136 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-25 07:09:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:55,137 INFO L229 MonitoredProcess]: Starting monitored process 12 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-25 07:09:55,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 07:09:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:55,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:09:55,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:55,246 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-25 07:09:55,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:55,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622952706] [2023-12-25 07:09:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622952706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97367682] [2023-12-25 07:09:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:55,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:09:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:09:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:09:55,248 INFO L87 Difference]: Start difference. First operand 2998 states and 4180 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:09:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:55,442 INFO L93 Difference]: Finished difference Result 6000 states and 8352 transitions. [2023-12-25 07:09:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:09:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2023-12-25 07:09:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:55,454 INFO L225 Difference]: With dead ends: 6000 [2023-12-25 07:09:55,454 INFO L226 Difference]: Without dead ends: 3013 [2023-12-25 07:09:55,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:09:55,461 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 229 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:55,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 783 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:09:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2023-12-25 07:09:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2994. [2023-12-25 07:09:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2481 states have (on average 1.3712212817412335) internal successors, (3402), 2524 states have internal predecessors, (3402), 312 states have call successors, (312), 185 states have call predecessors, (312), 200 states have return successors, (454), 286 states have call predecessors, (454), 309 states have call successors, (454) [2023-12-25 07:09:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4168 transitions. [2023-12-25 07:09:55,586 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4168 transitions. Word has length 68 [2023-12-25 07:09:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:55,587 INFO L495 AbstractCegarLoop]: Abstraction has 2994 states and 4168 transitions. [2023-12-25 07:09:55,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:09:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4168 transitions. [2023-12-25 07:09:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:09:55,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:55,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:55,594 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:55,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-25 07:09:55,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:55,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1384103532, now seen corresponding path program 1 times [2023-12-25 07:09:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514306557] [2023-12-25 07:09:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:55,793 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-25 07:09:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:55,794 INFO L229 MonitoredProcess]: Starting monitored process 13 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-25 07:09:55,795 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 (13)] Waiting until timeout for monitored process [2023-12-25 07:09:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:55,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:55,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 07:09:55,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:55,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514306557] [2023-12-25 07:09:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514306557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:09:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120332317] [2023-12-25 07:09:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:55,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:55,850 INFO L87 Difference]: Start difference. First operand 2994 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:55,960 INFO L93 Difference]: Finished difference Result 6020 states and 8352 transitions. [2023-12-25 07:09:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:55,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:09:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:55,970 INFO L225 Difference]: With dead ends: 6020 [2023-12-25 07:09:55,970 INFO L226 Difference]: Without dead ends: 3036 [2023-12-25 07:09:55,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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-25 07:09:55,978 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 147 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:55,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 305 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2023-12-25 07:09:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2977. [2023-12-25 07:09:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2465 states have (on average 1.3541582150101419) internal successors, (3338), 2508 states have internal predecessors, (3338), 311 states have call successors, (311), 185 states have call predecessors, (311), 200 states have return successors, (396), 284 states have call predecessors, (396), 308 states have call successors, (396) [2023-12-25 07:09:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4045 transitions. [2023-12-25 07:09:56,102 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4045 transitions. Word has length 71 [2023-12-25 07:09:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:56,102 INFO L495 AbstractCegarLoop]: Abstraction has 2977 states and 4045 transitions. [2023-12-25 07:09:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:09:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4045 transitions. [2023-12-25 07:09:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:09:56,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:56,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:56,126 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 (13)] Ended with exit code 0 [2023-12-25 07:09:56,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-25 07:09:56,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:56,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1794577429, now seen corresponding path program 1 times [2023-12-25 07:09:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235756991] [2023-12-25 07:09:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:56,307 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-25 07:09:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:56,311 INFO L229 MonitoredProcess]: Starting monitored process 14 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-25 07:09:56,313 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 (14)] Waiting until timeout for monitored process [2023-12-25 07:09:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:56,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:09:56,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:09:56,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:56,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235756991] [2023-12-25 07:09:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235756991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:09:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125552030] [2023-12-25 07:09:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:56,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:09:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:09:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:09:56,390 INFO L87 Difference]: Start difference. First operand 2977 states and 4045 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 07:09:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:56,701 INFO L93 Difference]: Finished difference Result 8985 states and 12391 transitions. [2023-12-25 07:09:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:09:56,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2023-12-25 07:09:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:56,721 INFO L225 Difference]: With dead ends: 8985 [2023-12-25 07:09:56,721 INFO L226 Difference]: Without dead ends: 6018 [2023-12-25 07:09:56,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-25 07:09:56,729 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:56,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 344 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:09:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2023-12-25 07:09:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 6013. [2023-12-25 07:09:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6013 states, 5005 states have (on average 1.3366633366633367) internal successors, (6690), 5096 states have internal predecessors, (6690), 591 states have call successors, (591), 361 states have call predecessors, (591), 416 states have return successors, (868), 556 states have call predecessors, (868), 588 states have call successors, (868) [2023-12-25 07:09:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6013 states to 6013 states and 8149 transitions. [2023-12-25 07:09:56,989 INFO L78 Accepts]: Start accepts. Automaton has 6013 states and 8149 transitions. Word has length 71 [2023-12-25 07:09:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:56,989 INFO L495 AbstractCegarLoop]: Abstraction has 6013 states and 8149 transitions. [2023-12-25 07:09:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 07:09:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6013 states and 8149 transitions. [2023-12-25 07:09:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 07:09:56,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:56,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:56,993 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-25 07:09:57,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:57,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1189828163, now seen corresponding path program 1 times [2023-12-25 07:09:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263750501] [2023-12-25 07:09:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:57,195 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-25 07:09:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:57,197 INFO L229 MonitoredProcess]: Starting monitored process 15 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-25 07:09:57,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 07:09:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:57,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:09:57,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:09:57,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:09:57,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263750501] [2023-12-25 07:09:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263750501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:09:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:09:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:09:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911462538] [2023-12-25 07:09:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:09:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:09:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:09:57,250 INFO L87 Difference]: Start difference. First operand 6013 states and 8149 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:57,559 INFO L93 Difference]: Finished difference Result 16497 states and 22514 transitions. [2023-12-25 07:09:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:09:57,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2023-12-25 07:09:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:57,593 INFO L225 Difference]: With dead ends: 16497 [2023-12-25 07:09:57,594 INFO L226 Difference]: Without dead ends: 10494 [2023-12-25 07:09:57,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-25 07:09:57,608 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 120 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:57,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 422 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:09:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2023-12-25 07:09:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 10491. [2023-12-25 07:09:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 8667 states have (on average 1.3231798776970116) internal successors, (11468), 8827 states have internal predecessors, (11468), 1070 states have call successors, (1070), 654 states have call predecessors, (1070), 753 states have return successors, (1712), 1011 states have call predecessors, (1712), 1067 states have call successors, (1712) [2023-12-25 07:09:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 14250 transitions. [2023-12-25 07:09:58,033 INFO L78 Accepts]: Start accepts. Automaton has 10491 states and 14250 transitions. Word has length 73 [2023-12-25 07:09:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:58,034 INFO L495 AbstractCegarLoop]: Abstraction has 10491 states and 14250 transitions. [2023-12-25 07:09:58,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:09:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10491 states and 14250 transitions. [2023-12-25 07:09:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 07:09:58,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:58,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:58,046 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:58,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-25 07:09:58,240 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:58,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash -913772689, now seen corresponding path program 1 times [2023-12-25 07:09:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898338415] [2023-12-25 07:09:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:58,241 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-25 07:09:58,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:58,242 INFO L229 MonitoredProcess]: Starting monitored process 16 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-25 07:09:58,273 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 (16)] Waiting until timeout for monitored process [2023-12-25 07:09:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:09:58,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:09:58,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:09:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:09:58,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:09:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:09:58,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:09:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898338415] [2023-12-25 07:09:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898338415] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:09:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:09:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-12-25 07:09:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809994700] [2023-12-25 07:09:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:09:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:09:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:09:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:09:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:09:58,468 INFO L87 Difference]: Start difference. First operand 10491 states and 14250 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:09:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:59,393 INFO L93 Difference]: Finished difference Result 28881 states and 39447 transitions. [2023-12-25 07:09:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:09:59,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2023-12-25 07:09:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:59,450 INFO L225 Difference]: With dead ends: 28881 [2023-12-25 07:09:59,450 INFO L226 Difference]: Without dead ends: 20071 [2023-12-25 07:09:59,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:09:59,470 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 708 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:59,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 650 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:09:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20071 states. [2023-12-25 07:10:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20071 to 17753. [2023-12-25 07:10:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17753 states, 14751 states have (on average 1.3372652701511762) internal successors, (19726), 14979 states have internal predecessors, (19726), 1758 states have call successors, (1758), 1074 states have call predecessors, (1758), 1243 states have return successors, (2890), 1701 states have call predecessors, (2890), 1755 states have call successors, (2890) [2023-12-25 07:10:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17753 states to 17753 states and 24374 transitions. [2023-12-25 07:10:00,322 INFO L78 Accepts]: Start accepts. Automaton has 17753 states and 24374 transitions. Word has length 77 [2023-12-25 07:10:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:00,322 INFO L495 AbstractCegarLoop]: Abstraction has 17753 states and 24374 transitions. [2023-12-25 07:10:00,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17753 states and 24374 transitions. [2023-12-25 07:10:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 07:10:00,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:00,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:00,346 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 (16)] Ended with exit code 0 [2023-12-25 07:10:00,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-25 07:10:00,529 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:00,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -725910813, now seen corresponding path program 1 times [2023-12-25 07:10:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467018613] [2023-12-25 07:10:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:00,529 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-25 07:10:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:00,545 INFO L229 MonitoredProcess]: Starting monitored process 17 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-25 07:10:00,580 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 (17)] Waiting until timeout for monitored process [2023-12-25 07:10:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:00,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:10:00,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:10:00,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:10:00,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467018613] [2023-12-25 07:10:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467018613] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:10:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:10:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-25 07:10:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229684052] [2023-12-25 07:10:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:00,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:10:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:10:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:00,764 INFO L87 Difference]: Start difference. First operand 17753 states and 24374 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:01,989 INFO L93 Difference]: Finished difference Result 42025 states and 57855 transitions. [2023-12-25 07:10:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:10:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2023-12-25 07:10:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:02,058 INFO L225 Difference]: With dead ends: 42025 [2023-12-25 07:10:02,058 INFO L226 Difference]: Without dead ends: 26607 [2023-12-25 07:10:02,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:10:02,081 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 405 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:02,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1469 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26607 states. [2023-12-25 07:10:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26607 to 23745. [2023-12-25 07:10:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23745 states, 19791 states have (on average 1.3471780102066595) internal successors, (26662), 20079 states have internal predecessors, (26662), 2314 states have call successors, (2314), 1414 states have call predecessors, (2314), 1639 states have return successors, (3866), 2253 states have call predecessors, (3866), 2311 states have call successors, (3866) [2023-12-25 07:10:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23745 states to 23745 states and 32842 transitions. [2023-12-25 07:10:02,986 INFO L78 Accepts]: Start accepts. Automaton has 23745 states and 32842 transitions. Word has length 80 [2023-12-25 07:10:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:02,987 INFO L495 AbstractCegarLoop]: Abstraction has 23745 states and 32842 transitions. [2023-12-25 07:10:02,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 23745 states and 32842 transitions. [2023-12-25 07:10:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-25 07:10:02,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:02,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:03,011 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 (17)] Ended with exit code 0 [2023-12-25 07:10:03,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-25 07:10:03,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:03,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash 980379788, now seen corresponding path program 1 times [2023-12-25 07:10:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:03,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562275479] [2023-12-25 07:10:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:03,195 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-25 07:10:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:03,196 INFO L229 MonitoredProcess]: Starting monitored process 18 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-25 07:10:03,225 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 (18)] Waiting until timeout for monitored process [2023-12-25 07:10:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:03,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:03,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:10:03,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:03,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562275479] [2023-12-25 07:10:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562275479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:03,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032946258] [2023-12-25 07:10:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:03,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:03,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:03,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:03,264 INFO L87 Difference]: Start difference. First operand 23745 states and 32842 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:04,469 INFO L93 Difference]: Finished difference Result 47699 states and 65899 transitions. [2023-12-25 07:10:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2023-12-25 07:10:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:04,527 INFO L225 Difference]: With dead ends: 47699 [2023-12-25 07:10:04,527 INFO L226 Difference]: Without dead ends: 23968 [2023-12-25 07:10:04,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-25 07:10:04,554 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 122 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:04,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 410 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2023-12-25 07:10:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23834. [2023-12-25 07:10:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23834 states, 19879 states have (on average 1.3340711303385482) internal successors, (26520), 20145 states have internal predecessors, (26520), 2292 states have call successors, (2292), 1437 states have call predecessors, (2292), 1662 states have return successors, (3454), 2253 states have call predecessors, (3454), 2289 states have call successors, (3454) [2023-12-25 07:10:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23834 states to 23834 states and 32266 transitions. [2023-12-25 07:10:05,545 INFO L78 Accepts]: Start accepts. Automaton has 23834 states and 32266 transitions. Word has length 86 [2023-12-25 07:10:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:05,546 INFO L495 AbstractCegarLoop]: Abstraction has 23834 states and 32266 transitions. [2023-12-25 07:10:05,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23834 states and 32266 transitions. [2023-12-25 07:10:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-25 07:10:05,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:05,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:05,563 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:05,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-25 07:10:05,751 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:05,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1303924748, now seen corresponding path program 1 times [2023-12-25 07:10:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772193024] [2023-12-25 07:10:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:05,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:10:05,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:05,752 INFO L229 MonitoredProcess]: Starting monitored process 19 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-25 07:10:05,755 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 (19)] Waiting until timeout for monitored process [2023-12-25 07:10:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:05,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:10:05,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:05,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:05,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772193024] [2023-12-25 07:10:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772193024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:05,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:05,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2023-12-25 07:10:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387517080] [2023-12-25 07:10:05,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:05,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:10:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:05,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:10:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:05,970 INFO L87 Difference]: Start difference. First operand 23834 states and 32266 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-25 07:10:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:06,848 INFO L93 Difference]: Finished difference Result 45481 states and 61701 transitions. [2023-12-25 07:10:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:10:06,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-25 07:10:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:06,909 INFO L225 Difference]: With dead ends: 45481 [2023-12-25 07:10:06,909 INFO L226 Difference]: Without dead ends: 23994 [2023-12-25 07:10:06,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:10:06,942 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 215 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:06,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1056 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2023-12-25 07:10:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 22130. [2023-12-25 07:10:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22130 states, 18463 states have (on average 1.3340735525104264) internal successors, (24631), 18693 states have internal predecessors, (24631), 2130 states have call successors, (2130), 1329 states have call predecessors, (2130), 1536 states have return successors, (3214), 2109 states have call predecessors, (3214), 2127 states have call successors, (3214) [2023-12-25 07:10:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22130 states to 22130 states and 29975 transitions. [2023-12-25 07:10:07,952 INFO L78 Accepts]: Start accepts. Automaton has 22130 states and 29975 transitions. Word has length 87 [2023-12-25 07:10:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:07,953 INFO L495 AbstractCegarLoop]: Abstraction has 22130 states and 29975 transitions. [2023-12-25 07:10:07,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-25 07:10:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 22130 states and 29975 transitions. [2023-12-25 07:10:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-25 07:10:07,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:07,980 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:07,983 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 (19)] Ended with exit code 0 [2023-12-25 07:10:08,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-25 07:10:08,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:08,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1824724012, now seen corresponding path program 1 times [2023-12-25 07:10:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827566175] [2023-12-25 07:10:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:08,184 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-25 07:10:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:08,185 INFO L229 MonitoredProcess]: Starting monitored process 20 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-25 07:10:08,203 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 (20)] Waiting until timeout for monitored process [2023-12-25 07:10:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:08,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:10:08,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:10:08,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:08,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:08,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827566175] [2023-12-25 07:10:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827566175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:08,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:10:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550111133] [2023-12-25 07:10:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:08,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:10:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:10:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:10:08,328 INFO L87 Difference]: Start difference. First operand 22130 states and 29975 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 07:10:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:09,436 INFO L93 Difference]: Finished difference Result 44585 states and 60185 transitions. [2023-12-25 07:10:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:10:09,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2023-12-25 07:10:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:09,492 INFO L225 Difference]: With dead ends: 44585 [2023-12-25 07:10:09,492 INFO L226 Difference]: Without dead ends: 22469 [2023-12-25 07:10:09,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-25 07:10:09,529 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 144 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:09,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 335 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22469 states. [2023-12-25 07:10:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22469 to 22466. [2023-12-25 07:10:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22466 states, 18631 states have (on average 1.3231710589877086) internal successors, (24652), 19029 states have internal predecessors, (24652), 2130 states have call successors, (2130), 1329 states have call predecessors, (2130), 1704 states have return successors, (3214), 2109 states have call predecessors, (3214), 2127 states have call successors, (3214) [2023-12-25 07:10:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22466 states to 22466 states and 29996 transitions. [2023-12-25 07:10:10,404 INFO L78 Accepts]: Start accepts. Automaton has 22466 states and 29996 transitions. Word has length 89 [2023-12-25 07:10:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:10,404 INFO L495 AbstractCegarLoop]: Abstraction has 22466 states and 29996 transitions. [2023-12-25 07:10:10,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 07:10:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22466 states and 29996 transitions. [2023-12-25 07:10:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-25 07:10:10,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:10,408 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:10,424 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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:10,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-25 07:10:10,610 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:10,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash -903485334, now seen corresponding path program 1 times [2023-12-25 07:10:10,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:10,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995670941] [2023-12-25 07:10:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:10,611 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-25 07:10:10,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:10,615 INFO L229 MonitoredProcess]: Starting monitored process 21 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-25 07:10:10,616 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 (21)] Waiting until timeout for monitored process [2023-12-25 07:10:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:10,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:10,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:10:10,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:10,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995670941] [2023-12-25 07:10:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995670941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:10,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:10,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332375282] [2023-12-25 07:10:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:10,663 INFO L87 Difference]: Start difference. First operand 22466 states and 29996 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:11,364 INFO L93 Difference]: Finished difference Result 24108 states and 32043 transitions. [2023-12-25 07:10:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:11,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2023-12-25 07:10:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:11,406 INFO L225 Difference]: With dead ends: 24108 [2023-12-25 07:10:11,406 INFO L226 Difference]: Without dead ends: 22462 [2023-12-25 07:10:11,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-25 07:10:11,417 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:11,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 157 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22462 states. [2023-12-25 07:10:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22462 to 22004. [2023-12-25 07:10:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22004 states, 18256 states have (on average 1.323345749342682) internal successors, (24159), 18647 states have internal predecessors, (24159), 2079 states have call successors, (2079), 1299 states have call predecessors, (2079), 1668 states have return successors, (3151), 2058 states have call predecessors, (3151), 2076 states have call successors, (3151) [2023-12-25 07:10:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22004 states to 22004 states and 29389 transitions. [2023-12-25 07:10:12,241 INFO L78 Accepts]: Start accepts. Automaton has 22004 states and 29389 transitions. Word has length 89 [2023-12-25 07:10:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:12,241 INFO L495 AbstractCegarLoop]: Abstraction has 22004 states and 29389 transitions. [2023-12-25 07:10:12,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:10:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 22004 states and 29389 transitions. [2023-12-25 07:10:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-25 07:10:12,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:12,245 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:12,259 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:12,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-25 07:10:12,447 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 344553963, now seen corresponding path program 1 times [2023-12-25 07:10:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858876063] [2023-12-25 07:10:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:12,448 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-25 07:10:12,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:12,449 INFO L229 MonitoredProcess]: Starting monitored process 22 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-25 07:10:12,449 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 (22)] Waiting until timeout for monitored process [2023-12-25 07:10:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:12,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:12,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:10:12,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:12,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858876063] [2023-12-25 07:10:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858876063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048474443] [2023-12-25 07:10:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:12,507 INFO L87 Difference]: Start difference. First operand 22004 states and 29389 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:10:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:13,337 INFO L93 Difference]: Finished difference Result 46041 states and 61304 transitions. [2023-12-25 07:10:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:13,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-12-25 07:10:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:13,386 INFO L225 Difference]: With dead ends: 46041 [2023-12-25 07:10:13,386 INFO L226 Difference]: Without dead ends: 24047 [2023-12-25 07:10:13,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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-25 07:10:13,418 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 125 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:13,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 408 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24047 states. [2023-12-25 07:10:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24047 to 24042. [2023-12-25 07:10:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24042 states, 20182 states have (on average 1.3139431176295708) internal successors, (26518), 20619 states have internal predecessors, (26518), 2079 states have call successors, (2079), 1365 states have call predecessors, (2079), 1780 states have return successors, (2974), 2058 states have call predecessors, (2974), 2076 states have call successors, (2974) [2023-12-25 07:10:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24042 states to 24042 states and 31571 transitions. [2023-12-25 07:10:14,398 INFO L78 Accepts]: Start accepts. Automaton has 24042 states and 31571 transitions. Word has length 90 [2023-12-25 07:10:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:14,398 INFO L495 AbstractCegarLoop]: Abstraction has 24042 states and 31571 transitions. [2023-12-25 07:10:14,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:10:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 24042 states and 31571 transitions. [2023-12-25 07:10:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 07:10:14,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:14,404 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:14,406 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:14,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-25 07:10:14,606 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:14,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1398325679, now seen corresponding path program 1 times [2023-12-25 07:10:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799564717] [2023-12-25 07:10:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:14,607 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-25 07:10:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:14,608 INFO L229 MonitoredProcess]: Starting monitored process 23 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-25 07:10:14,608 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 (23)] Waiting until timeout for monitored process [2023-12-25 07:10:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:14,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:14,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:10:14,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:14,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799564717] [2023-12-25 07:10:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799564717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:14,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:14,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770766510] [2023-12-25 07:10:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:14,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:14,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:14,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:14,723 INFO L87 Difference]: Start difference. First operand 24042 states and 31571 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:10:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:15,869 INFO L93 Difference]: Finished difference Result 59423 states and 78266 transitions. [2023-12-25 07:10:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 109 [2023-12-25 07:10:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:16,043 INFO L225 Difference]: With dead ends: 59423 [2023-12-25 07:10:16,043 INFO L226 Difference]: Without dead ends: 36065 [2023-12-25 07:10:16,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-25 07:10:16,067 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 102 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:16,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 326 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36065 states. [2023-12-25 07:10:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36065 to 34917. [2023-12-25 07:10:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34917 states, 29222 states have (on average 1.3186640202587092) internal successors, (38534), 29890 states have internal predecessors, (38534), 3061 states have call successors, (3061), 1999 states have call predecessors, (3061), 2633 states have return successors, (4368), 3028 states have call predecessors, (4368), 3058 states have call successors, (4368) [2023-12-25 07:10:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34917 states to 34917 states and 45963 transitions. [2023-12-25 07:10:17,396 INFO L78 Accepts]: Start accepts. Automaton has 34917 states and 45963 transitions. Word has length 109 [2023-12-25 07:10:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:17,396 INFO L495 AbstractCegarLoop]: Abstraction has 34917 states and 45963 transitions. [2023-12-25 07:10:17,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:10:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 34917 states and 45963 transitions. [2023-12-25 07:10:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-25 07:10:17,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:17,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:17,408 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 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:17,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-25 07:10:17,608 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:17,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -662581811, now seen corresponding path program 1 times [2023-12-25 07:10:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830053813] [2023-12-25 07:10:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:17,609 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-25 07:10:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:17,610 INFO L229 MonitoredProcess]: Starting monitored process 24 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-25 07:10:17,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 (24)] Waiting until timeout for monitored process [2023-12-25 07:10:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:17,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:17,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 07:10:17,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:17,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830053813] [2023-12-25 07:10:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830053813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247398602] [2023-12-25 07:10:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:17,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:17,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:17,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:17,936 INFO L87 Difference]: Start difference. First operand 34917 states and 45963 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:10:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:20,180 INFO L93 Difference]: Finished difference Result 75787 states and 99274 transitions. [2023-12-25 07:10:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 125 [2023-12-25 07:10:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:20,288 INFO L225 Difference]: With dead ends: 75787 [2023-12-25 07:10:20,289 INFO L226 Difference]: Without dead ends: 53220 [2023-12-25 07:10:20,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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-25 07:10:20,317 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 78 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:20,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53220 states. [2023-12-25 07:10:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53220 to 53215. [2023-12-25 07:10:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53215 states, 44277 states have (on average 1.3024595162273866) internal successors, (57669), 45204 states have internal predecessors, (57669), 4785 states have call successors, (4785), 3275 states have call predecessors, (4785), 4152 states have return successors, (6365), 4736 states have call predecessors, (6365), 4782 states have call successors, (6365) [2023-12-25 07:10:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53215 states to 53215 states and 68819 transitions. [2023-12-25 07:10:22,781 INFO L78 Accepts]: Start accepts. Automaton has 53215 states and 68819 transitions. Word has length 125 [2023-12-25 07:10:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:22,781 INFO L495 AbstractCegarLoop]: Abstraction has 53215 states and 68819 transitions. [2023-12-25 07:10:22,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:10:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53215 states and 68819 transitions. [2023-12-25 07:10:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-25 07:10:22,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:22,790 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:22,795 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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-25 07:10:22,993 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:22,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1937350065, now seen corresponding path program 1 times [2023-12-25 07:10:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441634949] [2023-12-25 07:10:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:22,994 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-25 07:10:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:22,995 INFO L229 MonitoredProcess]: Starting monitored process 25 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-25 07:10:22,996 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 (25)] Waiting until timeout for monitored process [2023-12-25 07:10:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:23,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:10:23,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:10:23,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:23,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441634949] [2023-12-25 07:10:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441634949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:10:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431834860] [2023-12-25 07:10:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:23,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:10:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:10:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:23,072 INFO L87 Difference]: Start difference. First operand 53215 states and 68819 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-25 07:10:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:24,772 INFO L93 Difference]: Finished difference Result 87268 states and 113526 transitions. [2023-12-25 07:10:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:10:24,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2023-12-25 07:10:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:24,834 INFO L225 Difference]: With dead ends: 87268 [2023-12-25 07:10:24,834 INFO L226 Difference]: Without dead ends: 34063 [2023-12-25 07:10:24,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:10:24,874 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 57 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:24,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 731 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34063 states. [2023-12-25 07:10:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34063 to 32679. [2023-12-25 07:10:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32679 states, 28089 states have (on average 1.3125778774609278) internal successors, (36869), 28456 states have internal predecessors, (36869), 2394 states have call successors, (2394), 1557 states have call predecessors, (2394), 2195 states have return successors, (3325), 2665 states have call predecessors, (3325), 2391 states have call successors, (3325) [2023-12-25 07:10:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32679 states to 32679 states and 42588 transitions. [2023-12-25 07:10:26,436 INFO L78 Accepts]: Start accepts. Automaton has 32679 states and 42588 transitions. Word has length 128 [2023-12-25 07:10:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:26,436 INFO L495 AbstractCegarLoop]: Abstraction has 32679 states and 42588 transitions. [2023-12-25 07:10:26,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-25 07:10:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32679 states and 42588 transitions. [2023-12-25 07:10:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 07:10:26,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:26,441 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:26,446 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:26,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-25 07:10:26,644 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:26,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1198088179, now seen corresponding path program 1 times [2023-12-25 07:10:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822303797] [2023-12-25 07:10:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:26,645 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-25 07:10:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:26,646 INFO L229 MonitoredProcess]: Starting monitored process 26 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-25 07:10:26,647 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 (26)] Waiting until timeout for monitored process [2023-12-25 07:10:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:26,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:10:26,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:10:26,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:26,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822303797] [2023-12-25 07:10:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822303797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048568021] [2023-12-25 07:10:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:26,987 INFO L87 Difference]: Start difference. First operand 32679 states and 42588 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 07:10:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:28,209 INFO L93 Difference]: Finished difference Result 64905 states and 84659 transitions. [2023-12-25 07:10:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2023-12-25 07:10:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:28,265 INFO L225 Difference]: With dead ends: 64905 [2023-12-25 07:10:28,265 INFO L226 Difference]: Without dead ends: 32526 [2023-12-25 07:10:28,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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-25 07:10:28,292 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 43 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:28,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 292 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32526 states. [2023-12-25 07:10:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32526 to 32507. [2023-12-25 07:10:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32507 states, 27941 states have (on average 1.3133388210872912) internal successors, (36696), 28308 states have internal predecessors, (36696), 2382 states have call successors, (2382), 1545 states have call predecessors, (2382), 2183 states have return successors, (3313), 2653 states have call predecessors, (3313), 2379 states have call successors, (3313) [2023-12-25 07:10:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32507 states to 32507 states and 42391 transitions. [2023-12-25 07:10:29,746 INFO L78 Accepts]: Start accepts. Automaton has 32507 states and 42391 transitions. Word has length 140 [2023-12-25 07:10:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:29,746 INFO L495 AbstractCegarLoop]: Abstraction has 32507 states and 42391 transitions. [2023-12-25 07:10:29,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 07:10:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 32507 states and 42391 transitions. [2023-12-25 07:10:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 07:10:29,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:29,754 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:29,756 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-25 07:10:29,956 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:29,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1979012701, now seen corresponding path program 1 times [2023-12-25 07:10:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487631381] [2023-12-25 07:10:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:29,957 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-25 07:10:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:29,958 INFO L229 MonitoredProcess]: Starting monitored process 27 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-25 07:10:29,959 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 (27)] Waiting until timeout for monitored process [2023-12-25 07:10:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:30,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:10:30,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 07:10:30,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-25 07:10:30,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:30,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487631381] [2023-12-25 07:10:30,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487631381] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:30,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 07:10:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472444340] [2023-12-25 07:10:30,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:10:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:10:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:30,310 INFO L87 Difference]: Start difference. First operand 32507 states and 42391 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 5 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2023-12-25 07:10:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:31,904 INFO L93 Difference]: Finished difference Result 69166 states and 90513 transitions. [2023-12-25 07:10:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:10:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 5 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 153 [2023-12-25 07:10:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:31,971 INFO L225 Difference]: With dead ends: 69166 [2023-12-25 07:10:31,971 INFO L226 Difference]: Without dead ends: 36928 [2023-12-25 07:10:31,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:32,000 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 372 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:32,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 628 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36928 states. [2023-12-25 07:10:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36928 to 36226. [2023-12-25 07:10:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36226 states, 31042 states have (on average 1.3080020617228272) internal successors, (40603), 31479 states have internal predecessors, (40603), 2694 states have call successors, (2694), 1743 states have call predecessors, (2694), 2489 states have return successors, (3771), 3003 states have call predecessors, (3771), 2691 states have call successors, (3771) [2023-12-25 07:10:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36226 states to 36226 states and 47068 transitions. [2023-12-25 07:10:33,595 INFO L78 Accepts]: Start accepts. Automaton has 36226 states and 47068 transitions. Word has length 153 [2023-12-25 07:10:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:33,595 INFO L495 AbstractCegarLoop]: Abstraction has 36226 states and 47068 transitions. [2023-12-25 07:10:33,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 5 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2023-12-25 07:10:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 36226 states and 47068 transitions. [2023-12-25 07:10:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-25 07:10:33,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:33,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:33,601 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 (27)] Ended with exit code 0 [2023-12-25 07:10:33,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-25 07:10:33,801 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:33,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2060144142, now seen corresponding path program 1 times [2023-12-25 07:10:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458915925] [2023-12-25 07:10:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:33,802 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-25 07:10:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:33,803 INFO L229 MonitoredProcess]: Starting monitored process 28 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-25 07:10:33,839 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 (28)] Waiting until timeout for monitored process [2023-12-25 07:10:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:33,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:33,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 07:10:33,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:33,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458915925] [2023-12-25 07:10:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458915925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743258553] [2023-12-25 07:10:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:33,989 INFO L87 Difference]: Start difference. First operand 36226 states and 47068 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:35,084 INFO L93 Difference]: Finished difference Result 66915 states and 87276 transitions. [2023-12-25 07:10:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:35,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 160 [2023-12-25 07:10:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:35,141 INFO L225 Difference]: With dead ends: 66915 [2023-12-25 07:10:35,141 INFO L226 Difference]: Without dead ends: 30713 [2023-12-25 07:10:35,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 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-25 07:10:35,175 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 54 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:35,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 309 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30713 states. [2023-12-25 07:10:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30713 to 30709. [2023-12-25 07:10:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30709 states, 26513 states have (on average 1.3156187530645345) internal successors, (34881), 26938 states have internal predecessors, (34881), 2138 states have call successors, (2138), 1403 states have call predecessors, (2138), 2057 states have return successors, (3109), 2367 states have call predecessors, (3109), 2135 states have call successors, (3109) [2023-12-25 07:10:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30709 states to 30709 states and 40128 transitions. [2023-12-25 07:10:36,498 INFO L78 Accepts]: Start accepts. Automaton has 30709 states and 40128 transitions. Word has length 160 [2023-12-25 07:10:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:36,499 INFO L495 AbstractCegarLoop]: Abstraction has 30709 states and 40128 transitions. [2023-12-25 07:10:36,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 30709 states and 40128 transitions. [2023-12-25 07:10:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-25 07:10:36,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:36,501 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:36,506 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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:36,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-25 07:10:36,704 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:36,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -654811159, now seen corresponding path program 1 times [2023-12-25 07:10:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678503131] [2023-12-25 07:10:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:36,705 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-25 07:10:36,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:36,706 INFO L229 MonitoredProcess]: Starting monitored process 29 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-25 07:10:36,707 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 (29)] Waiting until timeout for monitored process [2023-12-25 07:10:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:36,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:36,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:10:36,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:36,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678503131] [2023-12-25 07:10:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678503131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:36,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356162908] [2023-12-25 07:10:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:36,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:36,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:36,835 INFO L87 Difference]: Start difference. First operand 30709 states and 40128 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-25 07:10:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:37,942 INFO L93 Difference]: Finished difference Result 61501 states and 81222 transitions. [2023-12-25 07:10:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 165 [2023-12-25 07:10:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:37,991 INFO L225 Difference]: With dead ends: 61501 [2023-12-25 07:10:37,991 INFO L226 Difference]: Without dead ends: 30936 [2023-12-25 07:10:38,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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-25 07:10:38,021 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 111 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:38,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 324 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2023-12-25 07:10:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 30900. [2023-12-25 07:10:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30900 states, 26677 states have (on average 1.2863515387787232) internal successors, (34316), 27106 states have internal predecessors, (34316), 2150 states have call successors, (2150), 1415 states have call predecessors, (2150), 2072 states have return successors, (3128), 2378 states have call predecessors, (3128), 2147 states have call successors, (3128) [2023-12-25 07:10:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 39594 transitions. [2023-12-25 07:10:39,571 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 39594 transitions. Word has length 165 [2023-12-25 07:10:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:39,572 INFO L495 AbstractCegarLoop]: Abstraction has 30900 states and 39594 transitions. [2023-12-25 07:10:39,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-25 07:10:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 39594 transitions. [2023-12-25 07:10:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-25 07:10:39,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:39,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:39,579 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 (29)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:39,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-25 07:10:39,777 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:39,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1899890791, now seen corresponding path program 1 times [2023-12-25 07:10:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117171739] [2023-12-25 07:10:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:39,778 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-25 07:10:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:39,779 INFO L229 MonitoredProcess]: Starting monitored process 30 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-25 07:10:39,781 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 (30)] Waiting until timeout for monitored process [2023-12-25 07:10:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:39,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:39,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-25 07:10:39,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:39,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:39,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117171739] [2023-12-25 07:10:39,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117171739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:39,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:39,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924633762] [2023-12-25 07:10:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:39,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:39,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:39,916 INFO L87 Difference]: Start difference. First operand 30900 states and 39594 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:41,300 INFO L93 Difference]: Finished difference Result 67425 states and 87879 transitions. [2023-12-25 07:10:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 166 [2023-12-25 07:10:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:41,367 INFO L225 Difference]: With dead ends: 67425 [2023-12-25 07:10:41,367 INFO L226 Difference]: Without dead ends: 37098 [2023-12-25 07:10:41,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 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-25 07:10:41,396 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 84 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:41,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 382 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37098 states. [2023-12-25 07:10:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37098 to 36808. [2023-12-25 07:10:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36808 states, 31716 states have (on average 1.228717366628831) internal successors, (38970), 32275 states have internal predecessors, (38970), 2555 states have call successors, (2555), 1681 states have call predecessors, (2555), 2536 states have return successors, (4260), 2851 states have call predecessors, (4260), 2552 states have call successors, (4260) [2023-12-25 07:10:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36808 states to 36808 states and 45785 transitions. [2023-12-25 07:10:42,993 INFO L78 Accepts]: Start accepts. Automaton has 36808 states and 45785 transitions. Word has length 166 [2023-12-25 07:10:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:42,994 INFO L495 AbstractCegarLoop]: Abstraction has 36808 states and 45785 transitions. [2023-12-25 07:10:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36808 states and 45785 transitions. [2023-12-25 07:10:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-25 07:10:42,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:43,000 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:43,005 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:43,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-25 07:10:43,203 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:43,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -8340848, now seen corresponding path program 1 times [2023-12-25 07:10:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099845609] [2023-12-25 07:10:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:43,204 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-25 07:10:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:43,205 INFO L229 MonitoredProcess]: Starting monitored process 31 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-25 07:10:43,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 07:10:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:43,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:43,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 07:10:43,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:43,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099845609] [2023-12-25 07:10:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099845609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:43,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962896133] [2023-12-25 07:10:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:43,374 INFO L87 Difference]: Start difference. First operand 36808 states and 45785 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:44,802 INFO L93 Difference]: Finished difference Result 70414 states and 87643 transitions. [2023-12-25 07:10:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:44,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 170 [2023-12-25 07:10:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:44,866 INFO L225 Difference]: With dead ends: 70414 [2023-12-25 07:10:44,866 INFO L226 Difference]: Without dead ends: 35663 [2023-12-25 07:10:44,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 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-25 07:10:44,894 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 44 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:44,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 299 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35663 states. [2023-12-25 07:10:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35663 to 35663. [2023-12-25 07:10:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35663 states, 30797 states have (on average 1.2309315842452186) internal successors, (37909), 31354 states have internal predecessors, (37909), 2427 states have call successors, (2427), 1601 states have call predecessors, (2427), 2438 states have return successors, (4107), 2707 states have call predecessors, (4107), 2424 states have call successors, (4107) [2023-12-25 07:10:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35663 states to 35663 states and 44443 transitions. [2023-12-25 07:10:46,418 INFO L78 Accepts]: Start accepts. Automaton has 35663 states and 44443 transitions. Word has length 170 [2023-12-25 07:10:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:46,418 INFO L495 AbstractCegarLoop]: Abstraction has 35663 states and 44443 transitions. [2023-12-25 07:10:46,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 07:10:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35663 states and 44443 transitions. [2023-12-25 07:10:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-25 07:10:46,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:46,432 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:46,434 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 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:46,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-25 07:10:46,634 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:46,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1871933898, now seen corresponding path program 1 times [2023-12-25 07:10:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:46,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881063147] [2023-12-25 07:10:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:46,635 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-25 07:10:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:46,636 INFO L229 MonitoredProcess]: Starting monitored process 32 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-25 07:10:46,637 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 (32)] Waiting until timeout for monitored process [2023-12-25 07:10:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:46,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:10:46,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 07:10:46,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-12-25 07:10:47,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881063147] [2023-12-25 07:10:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881063147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:47,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2023-12-25 07:10:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789104203] [2023-12-25 07:10:47,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 07:10:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 07:10:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:47,023 INFO L87 Difference]: Start difference. First operand 35663 states and 44443 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-25 07:10:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:48,649 INFO L93 Difference]: Finished difference Result 69208 states and 86153 transitions. [2023-12-25 07:10:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:10:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2023-12-25 07:10:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:48,716 INFO L225 Difference]: With dead ends: 69208 [2023-12-25 07:10:48,716 INFO L226 Difference]: Without dead ends: 37427 [2023-12-25 07:10:48,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:10:48,743 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 280 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:48,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1776 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37427 states. [2023-12-25 07:10:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37427 to 35429. [2023-12-25 07:10:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35429 states, 30615 states have (on average 1.2306059121345745) internal successors, (37675), 31146 states have internal predecessors, (37675), 2401 states have call successors, (2401), 1575 states have call predecessors, (2401), 2412 states have return successors, (4081), 2707 states have call predecessors, (4081), 2398 states have call successors, (4081) [2023-12-25 07:10:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35429 states to 35429 states and 44157 transitions. [2023-12-25 07:10:50,300 INFO L78 Accepts]: Start accepts. Automaton has 35429 states and 44157 transitions. Word has length 186 [2023-12-25 07:10:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:50,300 INFO L495 AbstractCegarLoop]: Abstraction has 35429 states and 44157 transitions. [2023-12-25 07:10:50,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-25 07:10:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35429 states and 44157 transitions. [2023-12-25 07:10:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-25 07:10:50,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:50,305 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:50,307 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 (32)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:50,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-25 07:10:50,506 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:50,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1019837654, now seen corresponding path program 1 times [2023-12-25 07:10:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777082717] [2023-12-25 07:10:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:50,507 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-25 07:10:50,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:50,508 INFO L229 MonitoredProcess]: Starting monitored process 33 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-25 07:10:50,509 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 (33)] Waiting until timeout for monitored process [2023-12-25 07:10:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:50,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:50,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-25 07:10:50,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:50,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777082717] [2023-12-25 07:10:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777082717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530307041] [2023-12-25 07:10:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:50,613 INFO L87 Difference]: Start difference. First operand 35429 states and 44157 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:10:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:51,984 INFO L93 Difference]: Finished difference Result 68638 states and 85698 transitions. [2023-12-25 07:10:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 190 [2023-12-25 07:10:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:52,045 INFO L225 Difference]: With dead ends: 68638 [2023-12-25 07:10:52,045 INFO L226 Difference]: Without dead ends: 35440 [2023-12-25 07:10:52,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 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-25 07:10:52,070 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:52,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 448 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35440 states. [2023-12-25 07:10:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35440 to 35429. [2023-12-25 07:10:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35429 states, 30615 states have (on average 1.228940062061081) internal successors, (37624), 31146 states have internal predecessors, (37624), 2401 states have call successors, (2401), 1575 states have call predecessors, (2401), 2412 states have return successors, (4081), 2707 states have call predecessors, (4081), 2398 states have call successors, (4081) [2023-12-25 07:10:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35429 states to 35429 states and 44106 transitions. [2023-12-25 07:10:53,543 INFO L78 Accepts]: Start accepts. Automaton has 35429 states and 44106 transitions. Word has length 190 [2023-12-25 07:10:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:53,543 INFO L495 AbstractCegarLoop]: Abstraction has 35429 states and 44106 transitions. [2023-12-25 07:10:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:10:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 35429 states and 44106 transitions. [2023-12-25 07:10:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-25 07:10:53,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:53,547 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:53,550 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 (33)] Ended with exit code 0 [2023-12-25 07:10:53,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-25 07:10:53,750 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:53,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -100390469, now seen corresponding path program 1 times [2023-12-25 07:10:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342217309] [2023-12-25 07:10:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:10:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:53,752 INFO L229 MonitoredProcess]: Starting monitored process 34 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-25 07:10:53,757 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 (34)] Waiting until timeout for monitored process [2023-12-25 07:10:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:53,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:10:53,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 07:10:53,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:53,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342217309] [2023-12-25 07:10:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342217309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:10:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982619956] [2023-12-25 07:10:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:53,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:10:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:53,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:10:53,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:10:53,840 INFO L87 Difference]: Start difference. First operand 35429 states and 44106 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 07:10:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:55,245 INFO L93 Difference]: Finished difference Result 72844 states and 92101 transitions. [2023-12-25 07:10:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:10:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 192 [2023-12-25 07:10:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:55,317 INFO L225 Difference]: With dead ends: 72844 [2023-12-25 07:10:55,317 INFO L226 Difference]: Without dead ends: 38501 [2023-12-25 07:10:55,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:10:55,350 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 15 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:55,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 496 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38501 states. [2023-12-25 07:10:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38501 to 35295. [2023-12-25 07:10:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35295 states, 30481 states have (on average 1.210557396410879) internal successors, (36899), 31012 states have internal predecessors, (36899), 2401 states have call successors, (2401), 1575 states have call predecessors, (2401), 2412 states have return successors, (4081), 2707 states have call predecessors, (4081), 2398 states have call successors, (4081) [2023-12-25 07:10:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35295 states to 35295 states and 43381 transitions. [2023-12-25 07:10:56,916 INFO L78 Accepts]: Start accepts. Automaton has 35295 states and 43381 transitions. Word has length 192 [2023-12-25 07:10:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:56,917 INFO L495 AbstractCegarLoop]: Abstraction has 35295 states and 43381 transitions. [2023-12-25 07:10:56,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 07:10:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35295 states and 43381 transitions. [2023-12-25 07:10:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-12-25 07:10:56,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:56,921 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:56,924 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 (34)] Ended with exit code 0 [2023-12-25 07:10:57,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-25 07:10:57,124 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:57,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash 769643654, now seen corresponding path program 1 times [2023-12-25 07:10:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227084013] [2023-12-25 07:10:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:57,124 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-25 07:10:57,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:57,125 INFO L229 MonitoredProcess]: Starting monitored process 35 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-25 07:10:57,151 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 (35)] Waiting until timeout for monitored process [2023-12-25 07:10:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:57,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:10:57,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 1 proven. 79 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 07:10:57,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-25 07:10:57,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227084013] [2023-12-25 07:10:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227084013] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:57,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2023-12-25 07:10:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203201491] [2023-12-25 07:10:57,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:57,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:10:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:10:57,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:10:57,500 INFO L87 Difference]: Start difference. First operand 35295 states and 43381 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 3 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-25 07:10:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:59,118 INFO L93 Difference]: Finished difference Result 66771 states and 82051 transitions. [2023-12-25 07:10:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:10:59,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 3 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 193 [2023-12-25 07:10:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:59,183 INFO L225 Difference]: With dead ends: 66771 [2023-12-25 07:10:59,183 INFO L226 Difference]: Without dead ends: 36708 [2023-12-25 07:10:59,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:59,212 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 263 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:59,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1403 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36708 states. [2023-12-25 07:11:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36708 to 35285. [2023-12-25 07:11:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35285 states, 30471 states have (on average 1.209970135538709) internal successors, (36869), 31002 states have internal predecessors, (36869), 2401 states have call successors, (2401), 1575 states have call predecessors, (2401), 2412 states have return successors, (4081), 2707 states have call predecessors, (4081), 2398 states have call successors, (4081) [2023-12-25 07:11:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35285 states to 35285 states and 43351 transitions. [2023-12-25 07:11:00,649 INFO L78 Accepts]: Start accepts. Automaton has 35285 states and 43351 transitions. Word has length 193 [2023-12-25 07:11:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:11:00,649 INFO L495 AbstractCegarLoop]: Abstraction has 35285 states and 43351 transitions. [2023-12-25 07:11:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 3 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-25 07:11:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35285 states and 43351 transitions. [2023-12-25 07:11:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-25 07:11:00,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:11:00,653 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:11:00,656 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 (35)] Ended with exit code 0 [2023-12-25 07:11:00,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-25 07:11:00,856 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:11:00,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:11:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1715363987, now seen corresponding path program 1 times [2023-12-25 07:11:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:11:00,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730521811] [2023-12-25 07:11:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:11:00,857 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-25 07:11:00,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:11:00,858 INFO L229 MonitoredProcess]: Starting monitored process 36 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-25 07:11:00,867 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 (36)] Waiting until timeout for monitored process [2023-12-25 07:11:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:11:00,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:11:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:11:01,065 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:11:01,065 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:11:01,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:11:01,085 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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 07:11:01,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-25 07:11:01,275 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:11:01,277 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:11:01,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:11:01 BoogieIcfgContainer [2023-12-25 07:11:01,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:11:01,389 INFO L158 Benchmark]: Toolchain (without parser) took 72059.94ms. Allocated memory was 340.8MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 289.2MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-25 07:11:01,389 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 248.5MB. Free memory is still 199.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:11:01,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 340.8MB. Free memory was 289.2MB in the beginning and 274.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 07:11:01,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.06ms. Allocated memory is still 340.8MB. Free memory was 274.1MB in the beginning and 271.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:11:01,390 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 340.8MB. Free memory was 271.6MB in the beginning and 268.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:11:01,390 INFO L158 Benchmark]: RCFGBuilder took 424.29ms. Allocated memory is still 340.8MB. Free memory was 268.9MB in the beginning and 307.5MB in the end (delta: -38.6MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2023-12-25 07:11:01,390 INFO L158 Benchmark]: TraceAbstraction took 71344.99ms. Allocated memory was 340.8MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 307.0MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-25 07:11:01,390 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.12ms. Allocated memory is still 248.5MB. Free memory is still 199.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 340.8MB. Free memory was 289.2MB in the beginning and 274.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.06ms. Allocated memory is still 340.8MB. Free memory was 274.1MB in the beginning and 271.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 340.8MB. Free memory was 271.6MB in the beginning and 268.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 424.29ms. Allocated memory is still 340.8MB. Free memory was 268.9MB in the beginning and 307.5MB in the end (delta: -38.6MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * TraceAbstraction took 71344.99ms. Allocated memory was 340.8MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 307.0MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 3.0GB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int P_2_pc ; [L133] int P_2_st ; [L134] int P_2_i ; [L135] int P_2_ev ; [L200] int C_1_pc ; [L201] int C_1_st ; [L202] int C_1_i ; [L203] int C_1_ev ; [L204] int C_1_pr ; [L603] int count ; [L604] int __retres2 ; [L608] num = 0 [L609] i = 0 [L610] max_loop = 2 [L612] timer = 0 [L613] P_1_pc = 0 [L614] P_2_pc = 0 [L615] C_1_pc = 0 [L617] count = 0 [L618] CALL init_model() [L595] P_1_i = 1 [L596] P_2_i = 1 [L597] C_1_i = 1 [L618] RET init_model() [L619] CALL start_simulation() [L533] int kernel_st ; [L534] int tmp ; [L535] int tmp___0 ; [L539] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L540] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L541] CALL init_threads() [L304] COND TRUE (int )P_1_i == 1 [L305] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L309] COND TRUE (int )P_2_i == 1 [L310] P_2_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L314] COND TRUE (int )C_1_i == 1 [L315] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L541] RET init_threads() [L542] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L543] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L185] COND FALSE !((int )P_2_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L195] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L197] return (__retres1); [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L277] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L287] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L289] return (__retres1); [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L543] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L544] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L547] COND TRUE 1 [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L356] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L345] return (__retres1); [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L96] CALL write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, \old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=0, c=65, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND TRUE (int )P_2_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, timer=0] [L151] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, timer=0] [L154] CALL write_data(num, 'B') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, timer=0] [L154] RET write_data(num, 'B') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, timer=0] [L155] num += 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L157] COND FALSE !(\read(timer)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L167] P_2_pc = 1 [L168] P_2_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L388] RET P_2() [L396] COND TRUE (int )C_1_st == 0 [L398] tmp___1 = __VERIFIER_nondet_int() [L400] COND TRUE \read(tmp___1) [L402] C_1_st = 1 [L403] CALL C_1() [L206] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L209] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L224] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L226] COND FALSE !(num == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, timer=0] [L237] num -= 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, timer=0] [L238] COND FALSE !(! (num >= 0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, timer=0] [L246] CALL, EXPR read_data(num) [L33] char c ; [L34] char __retres3 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(i___0)=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, timer=0] [L37] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(i___0)=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, timer=0] [L41] COND TRUE i___0 == 1 [L42] __retres3 = data_1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(i___0)=1, __retres3=66, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, timer=0] [L52] return (__retres3); [L246] RET, EXPR read_data(num) [L246] c = read_data(num) [L247] i += 1 [L248] C_1_pc = 2 [L249] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, c=66, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L403] RET C_1() [L356] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=2, tmp___0=2, tmp___1=2, tmp___2=1] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, __retres1=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L345] return (__retres1); [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=2, tmp___0=2, tmp___1=2, tmp___2=1] [L359] tmp___2 = exists_runnable_thread() [L361] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=2, tmp___0=2, tmp___1=2, tmp___2=0] [L551] RET eval() [L554] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=0] [L555] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=0] [L558] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=0] [L559] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=0] [L560] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L129] return (__retres1); [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L186] COND FALSE !((int )P_2_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L195] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L197] return (__retres1); [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L278] COND FALSE !((int )C_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L287] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L289] return (__retres1); [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L560] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=0] [L561] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=0] [L564] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, __retres1=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L345] return (__retres1); [L564] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=0] [L564] tmp = exists_runnable_thread() [L566] COND TRUE tmp == 0 [L568] kernel_st = 4 [L569] CALL fire_time_events() [L438] C_1_ev = 1 [L439] P_1_ev = 1 [L440] P_2_ev = 1 [L569] RET fire_time_events() [L570] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L129] return (__retres1); [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND TRUE \read(tmp) [L478] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=1] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L186] COND TRUE (int )P_2_ev == 1 [L187] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L197] return (__retres1); [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND TRUE \read(tmp___0) [L486] P_2_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=1, tmp___0=1] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L278] COND TRUE (int )C_1_ev == 1 [L279] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L289] return (__retres1); [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND TRUE \read(tmp___1) [L494] C_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L570] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=0, tmp=0] [L571] CALL reset_time_events() [L449] COND TRUE (int )P_1_ev == 1 [L450] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L454] COND TRUE (int )P_2_ev == 1 [L455] P_2_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L459] COND TRUE (int )C_1_ev == 1 [L460] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L571] RET reset_time_events() [L577] CALL, EXPR stop_simulation() [L514] int tmp ; [L515] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L519] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, __retres1=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L345] return (__retres1); [L519] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L519] tmp = exists_runnable_thread() [L521] COND TRUE \read(tmp) [L522] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, __retres2=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp=1] [L529] return (__retres2); [L577] RET, EXPR stop_simulation() [L577] tmp___0 = stop_simulation() [L579] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=0, tmp=0, tmp___0=0] [L547] COND TRUE 1 [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L356] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, __retres1=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L345] return (__retres1); [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L96] CALL write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, \old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, \old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, data_0=65, data_1=66, e=0, i=1, i___0=1, max_loop=2, num=1, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, \old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=0] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND FALSE !((int )P_2_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L143] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L151] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L154] CALL write_data(num, 'B') VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=0] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, \old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=0] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, \old(data_0)=65, \old(data_1)=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, \old(data_0)=65, \old(data_1)=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.2s, OverallIterations: 35, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5393 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5364 mSDsluCounter, 18678 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11281 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3044 IncrementalHoareTripleChecker+Invalid, 3357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 7397 mSDtfsCounter, 3044 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4353 GetRequests, 4258 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53215occurred in iteration=23, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 18134 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3721 NumberOfCodeBlocks, 3721 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4321 ConstructedInterpolants, 0 QuantifiedInterpolants, 9053 SizeOfPredicates, 19 NumberOfNonLiveVariables, 6545 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 41 InterpolantComputations, 30 PerfectInterpolantSequences, 1670/1897 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 07:11:01,403 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...