/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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:28:57,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:28:57,974 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-22 02:28:57,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:28:57,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:28:57,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:28:57,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:28:57,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:28:57,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:28:57,999 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:28:57,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:28:57,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:28:58,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:28:58,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:28:58,000 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:28:58,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:28:58,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:28:58,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:28:58,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:28:58,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:28:58,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:28:58,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:28:58,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:28:58,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:28:58,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:28:58,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:28:58,008 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:28:58,009 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:28:58,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:28:58,009 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:28:58,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:28:58,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:28:58,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:28:58,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:28:58,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:28:58,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:28:58,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:28:58,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:28:58,012 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:28:58,012 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-22 02:28:58,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:28:58,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:28:58,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:28:58,200 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:28:58,200 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:28:58,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2023-12-22 02:28:59,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:28:59,312 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:28:59,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2023-12-22 02:28:59,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de46e9498/b5b4ffac9d4241ac83e18e183c742a4c/FLAG248ed539a [2023-12-22 02:28:59,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de46e9498/b5b4ffac9d4241ac83e18e183c742a4c [2023-12-22 02:28:59,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:28:59,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:28:59,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:28:59,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:28:59,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:28:59,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4ed63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59, skipping insertion in model container [2023-12-22 02:28:59,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,381 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:28:59,471 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2023-12-22 02:28:59,497 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2023-12-22 02:28:59,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:28:59,529 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:28:59,538 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2023-12-22 02:28:59,549 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2023-12-22 02:28:59,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:28:59,577 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:28:59,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59 WrapperNode [2023-12-22 02:28:59,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:28:59,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:28:59,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:28:59,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:28:59,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,612 INFO L138 Inliner]: procedures = 51, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 409 [2023-12-22 02:28:59,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:28:59,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:28:59,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:28:59,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:28:59,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,642 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-22 02:28:59,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:28:59,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:28:59,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:28:59,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:28:59,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:28:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:28:59,685 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-22 02:28:59,687 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-22 02:28:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:28:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:28:59,704 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:28:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:28:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:28:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:28:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:28:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:28:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:28:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:28:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:28:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-12-22 02:28:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-12-22 02:28:59,783 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:28:59,784 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:29:00,142 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:29:00,182 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:29:00,182 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-22 02:29:00,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:00 BoogieIcfgContainer [2023-12-22 02:29:00,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:29:00,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:29:00,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:29:00,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:29:00,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:28:59" (1/3) ... [2023-12-22 02:29:00,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569e2ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:00, skipping insertion in model container [2023-12-22 02:29:00,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (2/3) ... [2023-12-22 02:29:00,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569e2ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:00, skipping insertion in model container [2023-12-22 02:29:00,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:00" (3/3) ... [2023-12-22 02:29:00,191 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2023-12-22 02:29:00,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:29:00,204 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:29:00,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:29:00,241 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;@3bf11a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:29:00,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:29:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 130 states have (on average 1.646153846153846) internal successors, (214), 137 states have internal predecessors, (214), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-22 02:29:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 02:29:00,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:00,252 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] [2023-12-22 02:29:00,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:00,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -606829876, now seen corresponding path program 1 times [2023-12-22 02:29:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958561021] [2023-12-22 02:29:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:00,291 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-22 02:29:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:00,294 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-22 02:29:00,297 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-22 02:29:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:00,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:00,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:00,461 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-22 02:29:00,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:00,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958561021] [2023-12-22 02:29:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958561021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860786715] [2023-12-22 02:29:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:00,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:00,498 INFO L87 Difference]: Start difference. First operand has 166 states, 130 states have (on average 1.646153846153846) internal successors, (214), 137 states have internal predecessors, (214), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:00,620 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2023-12-22 02:29:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-22 02:29:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:00,635 INFO L225 Difference]: With dead ends: 373 [2023-12-22 02:29:00,635 INFO L226 Difference]: Without dead ends: 213 [2023-12-22 02:29:00,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-22 02:29:00,640 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 215 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:00,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 298 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-22 02:29:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2023-12-22 02:29:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 174 states have internal predecessors, (251), 27 states have call successors, (27), 12 states have call predecessors, (27), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2023-12-22 02:29:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 305 transitions. [2023-12-22 02:29:00,680 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 305 transitions. Word has length 37 [2023-12-22 02:29:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:00,681 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 305 transitions. [2023-12-22 02:29:00,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 305 transitions. [2023-12-22 02:29:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-22 02:29:00,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:00,683 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] [2023-12-22 02:29:00,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:00,886 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-22 02:29:00,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:00,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1995858696, now seen corresponding path program 1 times [2023-12-22 02:29:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140579820] [2023-12-22 02:29:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:00,888 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-22 02:29:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:00,891 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-22 02:29:00,896 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-22 02:29:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:00,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:00,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:00,997 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-22 02:29:00,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:00,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140579820] [2023-12-22 02:29:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140579820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457536724] [2023-12-22 02:29:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,001 INFO L87 Difference]: Start difference. First operand 209 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,078 INFO L93 Difference]: Finished difference Result 409 states and 597 transitions. [2023-12-22 02:29:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-22 02:29:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,082 INFO L225 Difference]: With dead ends: 409 [2023-12-22 02:29:01,082 INFO L226 Difference]: Without dead ends: 306 [2023-12-22 02:29:01,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-22 02:29:01,084 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 207 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 280 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-22 02:29:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2023-12-22 02:29:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 251 states have (on average 1.4422310756972112) internal successors, (362), 255 states have internal predecessors, (362), 35 states have call successors, (35), 16 states have call predecessors, (35), 14 states have return successors, (39), 31 states have call predecessors, (39), 31 states have call successors, (39) [2023-12-22 02:29:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2023-12-22 02:29:01,111 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 38 [2023-12-22 02:29:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,111 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2023-12-22 02:29:01,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2023-12-22 02:29:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 02:29:01,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,120 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] [2023-12-22 02:29:01,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:01,322 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-22 02:29:01,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:01,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -691838602, now seen corresponding path program 1 times [2023-12-22 02:29:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659573453] [2023-12-22 02:29:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:01,324 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-22 02:29:01,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:01,325 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-22 02:29:01,328 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-22 02:29:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:01,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:01,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:01,432 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-22 02:29:01,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:01,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659573453] [2023-12-22 02:29:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659573453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599301097] [2023-12-22 02:29:01,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,436 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,502 INFO L93 Difference]: Finished difference Result 654 states and 933 transitions. [2023-12-22 02:29:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-22 02:29:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,505 INFO L225 Difference]: With dead ends: 654 [2023-12-22 02:29:01,505 INFO L226 Difference]: Without dead ends: 458 [2023-12-22 02:29:01,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-22 02:29:01,507 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 58 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 428 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-22 02:29:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 407. [2023-12-22 02:29:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 344 states have (on average 1.427325581395349) internal successors, (491), 350 states have internal predecessors, (491), 41 states have call successors, (41), 22 states have call predecessors, (41), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2023-12-22 02:29:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 579 transitions. [2023-12-22 02:29:01,531 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 579 transitions. Word has length 39 [2023-12-22 02:29:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,532 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 579 transitions. [2023-12-22 02:29:01,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 579 transitions. [2023-12-22 02:29:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 02:29:01,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,537 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-22 02:29:01,544 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-22 02:29:01,739 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-22 02:29:01,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:01,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -717734268, now seen corresponding path program 1 times [2023-12-22 02:29:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165954504] [2023-12-22 02:29:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:01,741 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-22 02:29:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:01,742 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-22 02:29:01,744 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-22 02:29:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:01,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:01,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:01,807 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-22 02:29:01,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:01,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165954504] [2023-12-22 02:29:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165954504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793062502] [2023-12-22 02:29:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,809 INFO L87 Difference]: Start difference. First operand 407 states and 579 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-22 02:29:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,848 INFO L93 Difference]: Finished difference Result 503 states and 720 transitions. [2023-12-22 02:29:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 52 [2023-12-22 02:29:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,851 INFO L225 Difference]: With dead ends: 503 [2023-12-22 02:29:01,851 INFO L226 Difference]: Without dead ends: 407 [2023-12-22 02:29:01,851 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-22 02:29:01,852 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 141 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 291 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-22 02:29:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2023-12-22 02:29:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 344 states have (on average 1.4244186046511629) internal successors, (490), 350 states have internal predecessors, (490), 41 states have call successors, (41), 22 states have call predecessors, (41), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2023-12-22 02:29:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 578 transitions. [2023-12-22 02:29:01,886 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 578 transitions. Word has length 52 [2023-12-22 02:29:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,886 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 578 transitions. [2023-12-22 02:29:01,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-22 02:29:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 578 transitions. [2023-12-22 02:29:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 02:29:01,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,889 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-22 02:29:01,895 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-22 02:29:02,093 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-22 02:29:02,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1648960326, now seen corresponding path program 1 times [2023-12-22 02:29:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725919570] [2023-12-22 02:29:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,094 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-22 02:29:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,095 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-22 02:29:02,112 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-22 02:29:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,204 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-22 02:29:02,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725919570] [2023-12-22 02:29:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725919570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179634179] [2023-12-22 02:29:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:02,206 INFO L87 Difference]: Start difference. First operand 407 states and 578 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, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:02,497 INFO L93 Difference]: Finished difference Result 598 states and 861 transitions. [2023-12-22 02:29:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:02,497 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, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-22 02:29:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:02,500 INFO L225 Difference]: With dead ends: 598 [2023-12-22 02:29:02,500 INFO L226 Difference]: Without dead ends: 505 [2023-12-22 02:29:02,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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-22 02:29:02,502 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 323 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:02,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 492 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-12-22 02:29:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 496. [2023-12-22 02:29:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 416 states have (on average 1.4399038461538463) internal successors, (599), 423 states have internal predecessors, (599), 51 states have call successors, (51), 28 states have call predecessors, (51), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2023-12-22 02:29:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 708 transitions. [2023-12-22 02:29:02,532 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 708 transitions. Word has length 52 [2023-12-22 02:29:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:02,533 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 708 transitions. [2023-12-22 02:29:02,533 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, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 708 transitions. [2023-12-22 02:29:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 02:29:02,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:02,535 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-22 02:29:02,540 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-22 02:29:02,737 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-22 02:29:02,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2115961538, now seen corresponding path program 1 times [2023-12-22 02:29:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885293839] [2023-12-22 02:29:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,740 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-22 02:29:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,741 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-22 02:29:02,768 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-22 02:29:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,836 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-22 02:29:02,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885293839] [2023-12-22 02:29:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885293839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382255455] [2023-12-22 02:29:02,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:02,838 INFO L87 Difference]: Start difference. First operand 496 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,018 INFO L93 Difference]: Finished difference Result 678 states and 981 transitions. [2023-12-22 02:29:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:03,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-22 02:29:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,021 INFO L225 Difference]: With dead ends: 678 [2023-12-22 02:29:03,021 INFO L226 Difference]: Without dead ends: 496 [2023-12-22 02:29:03,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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-22 02:29:03,022 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 270 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 362 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-22 02:29:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2023-12-22 02:29:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 416 states have (on average 1.4230769230769231) internal successors, (592), 423 states have internal predecessors, (592), 51 states have call successors, (51), 28 states have call predecessors, (51), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2023-12-22 02:29:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 701 transitions. [2023-12-22 02:29:03,050 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 701 transitions. Word has length 52 [2023-12-22 02:29:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,050 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 701 transitions. [2023-12-22 02:29:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 701 transitions. [2023-12-22 02:29:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 02:29:03,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,051 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-22 02:29:03,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:03,254 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-22 02:29:03,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1332657210, now seen corresponding path program 1 times [2023-12-22 02:29:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393188399] [2023-12-22 02:29:03,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,255 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-22 02:29:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,257 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-22 02:29:03,276 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-22 02:29:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,338 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-22 02:29:03,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393188399] [2023-12-22 02:29:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393188399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504408586] [2023-12-22 02:29:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:03,340 INFO L87 Difference]: Start difference. First operand 496 states and 701 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,541 INFO L93 Difference]: Finished difference Result 712 states and 1019 transitions. [2023-12-22 02:29:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-22 02:29:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,544 INFO L225 Difference]: With dead ends: 712 [2023-12-22 02:29:03,544 INFO L226 Difference]: Without dead ends: 530 [2023-12-22 02:29:03,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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-22 02:29:03,545 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 278 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 356 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-12-22 02:29:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2023-12-22 02:29:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 444 states have (on average 1.4031531531531531) internal successors, (623), 451 states have internal predecessors, (623), 53 states have call successors, (53), 32 states have call predecessors, (53), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2023-12-22 02:29:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 736 transitions. [2023-12-22 02:29:03,593 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 736 transitions. Word has length 52 [2023-12-22 02:29:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,593 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 736 transitions. [2023-12-22 02:29:03,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 736 transitions. [2023-12-22 02:29:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 02:29:03,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,595 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-22 02:29:03,600 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-22 02:29:03,798 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-22 02:29:03,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -572000822, now seen corresponding path program 1 times [2023-12-22 02:29:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461672678] [2023-12-22 02:29:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,799 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-22 02:29:03,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,800 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-22 02:29:03,804 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-22 02:29:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,868 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-22 02:29:03,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461672678] [2023-12-22 02:29:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461672678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380306900] [2023-12-22 02:29:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:03,870 INFO L87 Difference]: Start difference. First operand 530 states and 736 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-22 02:29:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,938 INFO L93 Difference]: Finished difference Result 935 states and 1289 transitions. [2023-12-22 02:29:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 52 [2023-12-22 02:29:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,941 INFO L225 Difference]: With dead ends: 935 [2023-12-22 02:29:03,941 INFO L226 Difference]: Without dead ends: 720 [2023-12-22 02:29:03,941 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-22 02:29:03,942 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 185 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 349 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2023-12-22 02:29:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 718. [2023-12-22 02:29:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 592 states have (on average 1.3800675675675675) internal successors, (817), 602 states have internal predecessors, (817), 76 states have call successors, (76), 48 states have call predecessors, (76), 48 states have return successors, (84), 68 states have call predecessors, (84), 72 states have call successors, (84) [2023-12-22 02:29:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 977 transitions. [2023-12-22 02:29:03,984 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 977 transitions. Word has length 52 [2023-12-22 02:29:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,984 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 977 transitions. [2023-12-22 02:29:03,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-22 02:29:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 977 transitions. [2023-12-22 02:29:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-22 02:29:03,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,985 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:03,994 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 (9)] Ended with exit code 0 [2023-12-22 02:29:04,189 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-22 02:29:04,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash 551888671, now seen corresponding path program 1 times [2023-12-22 02:29:04,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622272813] [2023-12-22 02:29:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,190 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-22 02:29:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,191 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-22 02:29:04,192 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-22 02:29:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:04,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622272813] [2023-12-22 02:29:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622272813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138856852] [2023-12-22 02:29:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:04,263 INFO L87 Difference]: Start difference. First operand 718 states and 977 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,349 INFO L93 Difference]: Finished difference Result 1170 states and 1614 transitions. [2023-12-22 02:29:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-22 02:29:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,353 INFO L225 Difference]: With dead ends: 1170 [2023-12-22 02:29:04,353 INFO L226 Difference]: Without dead ends: 869 [2023-12-22 02:29:04,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-22 02:29:04,355 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 46 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 455 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2023-12-22 02:29:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2023-12-22 02:29:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 721 states have (on average 1.3536754507628295) internal successors, (976), 731 states have internal predecessors, (976), 90 states have call successors, (90), 56 states have call predecessors, (90), 56 states have return successors, (106), 82 states have call predecessors, (106), 86 states have call successors, (106) [2023-12-22 02:29:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1172 transitions. [2023-12-22 02:29:04,403 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1172 transitions. Word has length 54 [2023-12-22 02:29:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,403 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1172 transitions. [2023-12-22 02:29:04,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1172 transitions. [2023-12-22 02:29:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:29:04,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,405 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:04,410 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-22 02:29:04,608 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-22 02:29:04,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1856387684, now seen corresponding path program 1 times [2023-12-22 02:29:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223492400] [2023-12-22 02:29:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,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-22 02:29:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,610 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-22 02:29:04,624 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-22 02:29:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:04,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223492400] [2023-12-22 02:29:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223492400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056995063] [2023-12-22 02:29:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:04,680 INFO L87 Difference]: Start difference. First operand 869 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,759 INFO L93 Difference]: Finished difference Result 1354 states and 1831 transitions. [2023-12-22 02:29:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:04,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-12-22 02:29:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,764 INFO L225 Difference]: With dead ends: 1354 [2023-12-22 02:29:04,764 INFO L226 Difference]: Without dead ends: 982 [2023-12-22 02:29:04,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-22 02:29:04,765 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 187 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 277 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2023-12-22 02:29:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2023-12-22 02:29:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 820 states have (on average 1.3341463414634147) internal successors, (1094), 830 states have internal predecessors, (1094), 98 states have call successors, (98), 62 states have call predecessors, (98), 62 states have return successors, (118), 90 states have call predecessors, (118), 94 states have call successors, (118) [2023-12-22 02:29:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1310 transitions. [2023-12-22 02:29:04,846 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1310 transitions. Word has length 59 [2023-12-22 02:29:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,847 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1310 transitions. [2023-12-22 02:29:04,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1310 transitions. [2023-12-22 02:29:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:04,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,849 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:04,855 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-22 02:29:05,052 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-22 02:29:05,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 424839686, now seen corresponding path program 1 times [2023-12-22 02:29:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655883530] [2023-12-22 02:29:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,054 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-22 02:29:05,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,054 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-22 02:29:05,055 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-22 02:29:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:29:05,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:05,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655883530] [2023-12-22 02:29:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655883530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579795247] [2023-12-22 02:29:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:05,117 INFO L87 Difference]: Start difference. First operand 982 states and 1310 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,191 INFO L93 Difference]: Finished difference Result 1481 states and 1999 transitions. [2023-12-22 02:29:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:05,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-22 02:29:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,194 INFO L225 Difference]: With dead ends: 1481 [2023-12-22 02:29:05,194 INFO L226 Difference]: Without dead ends: 1043 [2023-12-22 02:29:05,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-22 02:29:05,196 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 11 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 619 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2023-12-22 02:29:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2023-12-22 02:29:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 849 states have (on average 1.3227326266195525) internal successors, (1123), 861 states have internal predecessors, (1123), 98 states have call successors, (98), 62 states have call predecessors, (98), 64 states have return successors, (120), 90 states have call predecessors, (120), 94 states have call successors, (120) [2023-12-22 02:29:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1341 transitions. [2023-12-22 02:29:05,237 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1341 transitions. Word has length 60 [2023-12-22 02:29:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,237 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1341 transitions. [2023-12-22 02:29:05,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1341 transitions. [2023-12-22 02:29:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:05,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,239 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] [2023-12-22 02:29:05,244 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-22 02:29:05,442 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-22 02:29:05,442 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash -419165816, now seen corresponding path program 1 times [2023-12-22 02:29:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324940273] [2023-12-22 02:29:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,443 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-22 02:29:05,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,444 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-22 02:29:05,451 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-22 02:29:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:29:05,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:05,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324940273] [2023-12-22 02:29:05,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324940273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:05,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:05,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625010165] [2023-12-22 02:29:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:05,500 INFO L87 Difference]: Start difference. First operand 1013 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,572 INFO L93 Difference]: Finished difference Result 1430 states and 1910 transitions. [2023-12-22 02:29:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-22 02:29:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,576 INFO L225 Difference]: With dead ends: 1430 [2023-12-22 02:29:05,576 INFO L226 Difference]: Without dead ends: 920 [2023-12-22 02:29:05,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-22 02:29:05,577 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 616 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2023-12-22 02:29:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914. [2023-12-22 02:29:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 764 states have (on average 1.3193717277486912) internal successors, (1008), 778 states have internal predecessors, (1008), 88 states have call successors, (88), 56 states have call predecessors, (88), 60 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2023-12-22 02:29:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1202 transitions. [2023-12-22 02:29:05,612 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1202 transitions. Word has length 60 [2023-12-22 02:29:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,613 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1202 transitions. [2023-12-22 02:29:05,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1202 transitions. [2023-12-22 02:29:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:05,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,616 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] [2023-12-22 02:29:05,621 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 (13)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:05,819 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-22 02:29:05,819 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1378473800, now seen corresponding path program 1 times [2023-12-22 02:29:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850484137] [2023-12-22 02:29:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,820 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-22 02:29:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,821 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-22 02:29:05,822 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-22 02:29:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:05,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:05,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850484137] [2023-12-22 02:29:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850484137] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596869397] [2023-12-22 02:29:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:05,972 INFO L87 Difference]: Start difference. First operand 914 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,092 INFO L93 Difference]: Finished difference Result 963 states and 1263 transitions. [2023-12-22 02:29:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-22 02:29:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,095 INFO L225 Difference]: With dead ends: 963 [2023-12-22 02:29:06,096 INFO L226 Difference]: Without dead ends: 960 [2023-12-22 02:29:06,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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-22 02:29:06,096 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 373 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 279 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2023-12-22 02:29:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 913. [2023-12-22 02:29:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 764 states have (on average 1.3167539267015707) internal successors, (1006), 777 states have internal predecessors, (1006), 87 states have call successors, (87), 56 states have call predecessors, (87), 60 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2023-12-22 02:29:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1199 transitions. [2023-12-22 02:29:06,153 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1199 transitions. Word has length 60 [2023-12-22 02:29:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,153 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1199 transitions. [2023-12-22 02:29:06,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1199 transitions. [2023-12-22 02:29:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:06,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,154 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] [2023-12-22 02:29:06,160 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-22 02:29:06,357 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-22 02:29:06,358 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:06,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:06,358 INFO L85 PathProgramCache]: Analyzing trace with hash -217600867, now seen corresponding path program 1 times [2023-12-22 02:29:06,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:06,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020917429] [2023-12-22 02:29:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:06,358 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-22 02:29:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:06,359 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-22 02:29:06,363 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-22 02:29:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:06,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:29:06,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:06,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:06,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020917429] [2023-12-22 02:29:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020917429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:29:06,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:29:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:29:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039452407] [2023-12-22 02:29:06,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:29:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:29:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:06,646 INFO L87 Difference]: Start difference. First operand 913 states and 1199 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-22 02:29:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,893 INFO L93 Difference]: Finished difference Result 1632 states and 2137 transitions. [2023-12-22 02:29:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:29:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2023-12-22 02:29:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,897 INFO L225 Difference]: With dead ends: 1632 [2023-12-22 02:29:06,897 INFO L226 Difference]: Without dead ends: 1629 [2023-12-22 02:29:06,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:06,898 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 415 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 867 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2023-12-22 02:29:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1216. [2023-12-22 02:29:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1031 states have (on average 1.3113482056256063) internal successors, (1352), 1050 states have internal predecessors, (1352), 106 states have call successors, (106), 69 states have call predecessors, (106), 77 states have return successors, (137), 97 states have call predecessors, (137), 103 states have call successors, (137) [2023-12-22 02:29:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1595 transitions. [2023-12-22 02:29:06,969 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1595 transitions. Word has length 61 [2023-12-22 02:29:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,970 INFO L495 AbstractCegarLoop]: Abstraction has 1216 states and 1595 transitions. [2023-12-22 02:29:06,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-22 02:29:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1595 transitions. [2023-12-22 02:29:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-22 02:29:06,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:29:06,976 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-22 02:29:07,175 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-22 02:29:07,176 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:07,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1030932284, now seen corresponding path program 2 times [2023-12-22 02:29:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024346018] [2023-12-22 02:29:07,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:29:07,177 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-22 02:29:07,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:07,178 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-22 02:29:07,182 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-22 02:29:07,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:29:07,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:29:07,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:07,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:07,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:07,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024346018] [2023-12-22 02:29:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024346018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:07,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710068173] [2023-12-22 02:29:07,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:07,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:07,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:07,250 INFO L87 Difference]: Start difference. First operand 1216 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-22 02:29:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:07,350 INFO L93 Difference]: Finished difference Result 1771 states and 2326 transitions. [2023-12-22 02:29:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-22 02:29:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:07,354 INFO L225 Difference]: With dead ends: 1771 [2023-12-22 02:29:07,354 INFO L226 Difference]: Without dead ends: 1120 [2023-12-22 02:29:07,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-22 02:29:07,357 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 189 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:07,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 296 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2023-12-22 02:29:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1108. [2023-12-22 02:29:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 936 states have (on average 1.3076923076923077) internal successors, (1224), 955 states have internal predecessors, (1224), 99 states have call successors, (99), 64 states have call predecessors, (99), 71 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2023-12-22 02:29:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1449 transitions. [2023-12-22 02:29:07,429 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1449 transitions. Word has length 78 [2023-12-22 02:29:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:07,430 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1449 transitions. [2023-12-22 02:29:07,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-22 02:29:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1449 transitions. [2023-12-22 02:29:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-22 02:29:07,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:07,432 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:07,437 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 (16)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:07,635 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-22 02:29:07,635 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:07,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 786851500, now seen corresponding path program 1 times [2023-12-22 02:29:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892830518] [2023-12-22 02:29:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:07,636 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-22 02:29:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:07,637 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-22 02:29:07,640 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-22 02:29:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:07,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:07,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-22 02:29:07,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:07,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892830518] [2023-12-22 02:29:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892830518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041967162] [2023-12-22 02:29:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:07,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:07,699 INFO L87 Difference]: Start difference. First operand 1108 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-22 02:29:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:07,776 INFO L93 Difference]: Finished difference Result 1551 states and 2062 transitions. [2023-12-22 02:29:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:07,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 84 [2023-12-22 02:29:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:07,780 INFO L225 Difference]: With dead ends: 1551 [2023-12-22 02:29:07,780 INFO L226 Difference]: Without dead ends: 1148 [2023-12-22 02:29:07,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-22 02:29:07,781 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 11 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:07,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 613 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-12-22 02:29:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1116. [2023-12-22 02:29:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 944 states have (on average 1.3008474576271187) internal successors, (1228), 963 states have internal predecessors, (1228), 99 states have call successors, (99), 64 states have call predecessors, (99), 71 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2023-12-22 02:29:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1453 transitions. [2023-12-22 02:29:07,849 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1453 transitions. Word has length 84 [2023-12-22 02:29:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:07,849 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1453 transitions. [2023-12-22 02:29:07,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-22 02:29:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1453 transitions. [2023-12-22 02:29:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-22 02:29:07,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:07,851 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:07,854 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 (17)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:08,054 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-22 02:29:08,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:08,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1755658288, now seen corresponding path program 1 times [2023-12-22 02:29:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495270707] [2023-12-22 02:29:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:08,056 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-22 02:29:08,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:08,057 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-22 02:29:08,058 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-22 02:29:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:08,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:08,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-22 02:29:08,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:08,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495270707] [2023-12-22 02:29:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495270707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147703612] [2023-12-22 02:29:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:08,119 INFO L87 Difference]: Start difference. First operand 1116 states and 1453 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-22 02:29:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,194 INFO L93 Difference]: Finished difference Result 1543 states and 2033 transitions. [2023-12-22 02:29:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:08,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 84 [2023-12-22 02:29:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,197 INFO L225 Difference]: With dead ends: 1543 [2023-12-22 02:29:08,198 INFO L226 Difference]: Without dead ends: 1132 [2023-12-22 02:29:08,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-22 02:29:08,199 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 2 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 607 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2023-12-22 02:29:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1124. [2023-12-22 02:29:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 952 states have (on average 1.2941176470588236) internal successors, (1232), 971 states have internal predecessors, (1232), 99 states have call successors, (99), 64 states have call predecessors, (99), 71 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2023-12-22 02:29:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1457 transitions. [2023-12-22 02:29:08,255 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1457 transitions. Word has length 84 [2023-12-22 02:29:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,255 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1457 transitions. [2023-12-22 02:29:08,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-22 02:29:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1457 transitions. [2023-12-22 02:29:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-22 02:29:08,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,270 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:08,280 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-22 02:29:08,473 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-22 02:29:08,473 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:08,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2055373868, now seen corresponding path program 1 times [2023-12-22 02:29:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:08,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781898495] [2023-12-22 02:29:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:08,474 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-22 02:29:08,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:08,475 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-22 02:29:08,508 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-22 02:29:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:08,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:29:08,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:08,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:08,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781898495] [2023-12-22 02:29:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781898495] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594577466] [2023-12-22 02:29:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:08,570 INFO L87 Difference]: Start difference. First operand 1124 states and 1457 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:29:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,812 INFO L93 Difference]: Finished difference Result 1614 states and 2093 transitions. [2023-12-22 02:29:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2023-12-22 02:29:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,816 INFO L225 Difference]: With dead ends: 1614 [2023-12-22 02:29:08,816 INFO L226 Difference]: Without dead ends: 1194 [2023-12-22 02:29:08,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:08,817 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 261 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 343 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2023-12-22 02:29:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1174. [2023-12-22 02:29:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 998 states have (on average 1.2685370741482966) internal successors, (1266), 1017 states have internal predecessors, (1266), 99 states have call successors, (99), 68 states have call predecessors, (99), 75 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2023-12-22 02:29:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1491 transitions. [2023-12-22 02:29:08,882 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1491 transitions. Word has length 84 [2023-12-22 02:29:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,882 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 1491 transitions. [2023-12-22 02:29:08,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:29:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1491 transitions. [2023-12-22 02:29:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-22 02:29:08,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,884 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:08,889 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 (19)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:09,090 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-22 02:29:09,091 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash -701253398, now seen corresponding path program 1 times [2023-12-22 02:29:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781522287] [2023-12-22 02:29:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,091 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-22 02:29:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,092 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-22 02:29:09,106 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-22 02:29:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:09,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781522287] [2023-12-22 02:29:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781522287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769740083] [2023-12-22 02:29:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:09,248 INFO L87 Difference]: Start difference. First operand 1174 states and 1491 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:29:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:09,494 INFO L93 Difference]: Finished difference Result 2032 states and 2564 transitions. [2023-12-22 02:29:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-12-22 02:29:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:09,499 INFO L225 Difference]: With dead ends: 2032 [2023-12-22 02:29:09,500 INFO L226 Difference]: Without dead ends: 1564 [2023-12-22 02:29:09,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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-22 02:29:09,501 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 233 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:09,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 400 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2023-12-22 02:29:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1560. [2023-12-22 02:29:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1305 states have (on average 1.2559386973180076) internal successors, (1639), 1333 states have internal predecessors, (1639), 140 states have call successors, (140), 96 states have call predecessors, (140), 113 states have return successors, (189), 132 states have call predecessors, (189), 137 states have call successors, (189) [2023-12-22 02:29:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1968 transitions. [2023-12-22 02:29:09,623 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1968 transitions. Word has length 84 [2023-12-22 02:29:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:09,623 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1968 transitions. [2023-12-22 02:29:09,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:29:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1968 transitions. [2023-12-22 02:29:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-22 02:29:09,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:09,625 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:09,634 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-22 02:29:09,828 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-22 02:29:09,829 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash -674187796, now seen corresponding path program 1 times [2023-12-22 02:29:09,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321219849] [2023-12-22 02:29:09,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,830 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-22 02:29:09,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,831 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-22 02:29:09,831 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-22 02:29:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,900 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-22 02:29:09,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321219849] [2023-12-22 02:29:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321219849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415339151] [2023-12-22 02:29:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:09,902 INFO L87 Difference]: Start difference. First operand 1560 states and 1968 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-22 02:29:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:09,999 INFO L93 Difference]: Finished difference Result 2410 states and 3011 transitions. [2023-12-22 02:29:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 84 [2023-12-22 02:29:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,004 INFO L225 Difference]: With dead ends: 2410 [2023-12-22 02:29:10,005 INFO L226 Difference]: Without dead ends: 1556 [2023-12-22 02:29:10,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-22 02:29:10,008 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 130 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 275 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2023-12-22 02:29:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2023-12-22 02:29:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1304 states have (on average 1.2553680981595092) internal successors, (1637), 1331 states have internal predecessors, (1637), 137 states have call successors, (137), 96 states have call predecessors, (137), 113 states have return successors, (186), 129 states have call predecessors, (186), 134 states have call successors, (186) [2023-12-22 02:29:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1960 transitions. [2023-12-22 02:29:10,121 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1960 transitions. Word has length 84 [2023-12-22 02:29:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,121 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 1960 transitions. [2023-12-22 02:29:10,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-22 02:29:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1960 transitions. [2023-12-22 02:29:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-22 02:29:10,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,123 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:10,127 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-22 02:29:10,326 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-22 02:29:10,326 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:10,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 227324655, now seen corresponding path program 1 times [2023-12-22 02:29:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382932049] [2023-12-22 02:29:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:10,327 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-22 02:29:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:10,328 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-22 02:29:10,355 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-22 02:29:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:10,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:10,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:10,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:10,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382932049] [2023-12-22 02:29:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382932049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197322248] [2023-12-22 02:29:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:10,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:10,399 INFO L87 Difference]: Start difference. First operand 1556 states and 1960 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:10,524 INFO L93 Difference]: Finished difference Result 2408 states and 3027 transitions. [2023-12-22 02:29:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2023-12-22 02:29:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,530 INFO L225 Difference]: With dead ends: 2408 [2023-12-22 02:29:10,530 INFO L226 Difference]: Without dead ends: 1868 [2023-12-22 02:29:10,532 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-22 02:29:10,533 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 81 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 476 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2023-12-22 02:29:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1868. [2023-12-22 02:29:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1556 states have (on average 1.2422879177377892) internal successors, (1933), 1585 states have internal predecessors, (1933), 171 states have call successors, (171), 120 states have call predecessors, (171), 139 states have return successors, (232), 163 states have call predecessors, (232), 168 states have call successors, (232) [2023-12-22 02:29:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2336 transitions. [2023-12-22 02:29:10,653 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2336 transitions. Word has length 86 [2023-12-22 02:29:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,653 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2336 transitions. [2023-12-22 02:29:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2336 transitions. [2023-12-22 02:29:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-22 02:29:10,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,655 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-22 02:29:10,661 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 (22)] Ended with exit code 0 [2023-12-22 02:29:10,858 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-22 02:29:10,859 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:10,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -943824036, now seen corresponding path program 1 times [2023-12-22 02:29:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:10,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672523338] [2023-12-22 02:29:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:10,860 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-22 02:29:10,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:10,861 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-22 02:29:10,862 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-22 02:29:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:10,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:10,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:10,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:10,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672523338] [2023-12-22 02:29:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672523338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:10,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:10,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244069641] [2023-12-22 02:29:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:10,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:10,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:10,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:10,963 INFO L87 Difference]: Start difference. First operand 1868 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:11,225 INFO L93 Difference]: Finished difference Result 2592 states and 3277 transitions. [2023-12-22 02:29:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:11,227 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), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2023-12-22 02:29:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:11,232 INFO L225 Difference]: With dead ends: 2592 [2023-12-22 02:29:11,232 INFO L226 Difference]: Without dead ends: 1901 [2023-12-22 02:29:11,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-22 02:29:11,234 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 227 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:11,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 310 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2023-12-22 02:29:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1868. [2023-12-22 02:29:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1556 states have (on average 1.2326478149100257) internal successors, (1918), 1585 states have internal predecessors, (1918), 171 states have call successors, (171), 120 states have call predecessors, (171), 139 states have return successors, (231), 163 states have call predecessors, (231), 168 states have call successors, (231) [2023-12-22 02:29:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2320 transitions. [2023-12-22 02:29:11,355 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2320 transitions. Word has length 92 [2023-12-22 02:29:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:11,355 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2320 transitions. [2023-12-22 02:29:11,356 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), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2320 transitions. [2023-12-22 02:29:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-22 02:29:11,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:11,358 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 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-22 02:29:11,364 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-22 02:29:11,559 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-22 02:29:11,559 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:11,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -749656727, now seen corresponding path program 1 times [2023-12-22 02:29:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:11,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667068669] [2023-12-22 02:29:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:11,560 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-22 02:29:11,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:11,561 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-22 02:29:11,590 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-22 02:29:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:11,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:11,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:11,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:11,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667068669] [2023-12-22 02:29:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667068669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688400589] [2023-12-22 02:29:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:11,638 INFO L87 Difference]: Start difference. First operand 1868 states and 2320 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:29:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:11,797 INFO L93 Difference]: Finished difference Result 2151 states and 2671 transitions. [2023-12-22 02:29:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:11,797 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 93 [2023-12-22 02:29:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:11,801 INFO L225 Difference]: With dead ends: 2151 [2023-12-22 02:29:11,801 INFO L226 Difference]: Without dead ends: 1172 [2023-12-22 02:29:11,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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-22 02:29:11,803 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:11,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 418 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-12-22 02:29:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2023-12-22 02:29:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 945 states have (on average 1.217989417989418) internal successors, (1151), 961 states have internal predecessors, (1151), 124 states have call successors, (124), 89 states have call predecessors, (124), 102 states have return successors, (158), 122 states have call predecessors, (158), 122 states have call successors, (158) [2023-12-22 02:29:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1433 transitions. [2023-12-22 02:29:11,879 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1433 transitions. Word has length 93 [2023-12-22 02:29:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:11,879 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1433 transitions. [2023-12-22 02:29:11,879 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:29:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1433 transitions. [2023-12-22 02:29:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-22 02:29:11,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:11,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:29:11,885 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-22 02:29:12,083 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-22 02:29:12,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1070443729, now seen corresponding path program 1 times [2023-12-22 02:29:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705525232] [2023-12-22 02:29:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,085 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-22 02:29:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,086 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-22 02:29:12,087 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-22 02:29:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:12,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:12,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:12,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:12,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:12,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705525232] [2023-12-22 02:29:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705525232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:12,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896632249] [2023-12-22 02:29:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:12,223 INFO L87 Difference]: Start difference. First operand 1172 states and 1433 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:29:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,338 INFO L93 Difference]: Finished difference Result 2645 states and 3225 transitions. [2023-12-22 02:29:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2023-12-22 02:29:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,343 INFO L225 Difference]: With dead ends: 2645 [2023-12-22 02:29:12,343 INFO L226 Difference]: Without dead ends: 1482 [2023-12-22 02:29:12,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 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-22 02:29:12,345 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 44 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 265 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-22 02:29:12,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 265 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-12-22 02:29:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1476. [2023-12-22 02:29:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1189 states have (on average 1.1984861227922623) internal successors, (1425), 1207 states have internal predecessors, (1425), 158 states have call successors, (158), 113 states have call predecessors, (158), 128 states have return successors, (194), 156 states have call predecessors, (194), 156 states have call successors, (194) [2023-12-22 02:29:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1777 transitions. [2023-12-22 02:29:12,439 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1777 transitions. Word has length 107 [2023-12-22 02:29:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:12,439 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 1777 transitions. [2023-12-22 02:29:12,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:29:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1777 transitions. [2023-12-22 02:29:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-22 02:29:12,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:12,441 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:12,444 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 (25)] Ended with exit code 0 [2023-12-22 02:29:12,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-22 02:29:12,644 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1260157274, now seen corresponding path program 1 times [2023-12-22 02:29:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007723435] [2023-12-22 02:29:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,646 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-22 02:29:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,647 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-22 02:29:12,659 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-22 02:29:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:12,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:12,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-22 02:29:12,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:12,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007723435] [2023-12-22 02:29:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007723435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:12,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927085837] [2023-12-22 02:29:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:12,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:12,749 INFO L87 Difference]: Start difference. First operand 1476 states and 1777 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,953 INFO L93 Difference]: Finished difference Result 2952 states and 3574 transitions. [2023-12-22 02:29:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2023-12-22 02:29:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,957 INFO L225 Difference]: With dead ends: 2952 [2023-12-22 02:29:12,957 INFO L226 Difference]: Without dead ends: 1486 [2023-12-22 02:29:12,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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-22 02:29:12,959 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 120 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:12,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 237 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2023-12-22 02:29:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2023-12-22 02:29:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1195 states have (on average 1.1790794979079497) internal successors, (1409), 1215 states have internal predecessors, (1409), 158 states have call successors, (158), 113 states have call predecessors, (158), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2023-12-22 02:29:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1749 transitions. [2023-12-22 02:29:13,068 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1749 transitions. Word has length 122 [2023-12-22 02:29:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,069 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 1749 transitions. [2023-12-22 02:29:13,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1749 transitions. [2023-12-22 02:29:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-22 02:29:13,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,070 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:13,074 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-22 02:29:13,274 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-22 02:29:13,274 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:13,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1286082992, now seen corresponding path program 1 times [2023-12-22 02:29:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133772195] [2023-12-22 02:29:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:13,275 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-22 02:29:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:13,276 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-22 02:29:13,277 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-22 02:29:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:13,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:13,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133772195] [2023-12-22 02:29:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133772195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771667051] [2023-12-22 02:29:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:13,358 INFO L87 Difference]: Start difference. First operand 1486 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,453 INFO L93 Difference]: Finished difference Result 2214 states and 2610 transitions. [2023-12-22 02:29:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-22 02:29:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,455 INFO L225 Difference]: With dead ends: 2214 [2023-12-22 02:29:13,456 INFO L226 Difference]: Without dead ends: 674 [2023-12-22 02:29:13,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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-22 02:29:13,458 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 97 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 272 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-22 02:29:13,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 272 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-12-22 02:29:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2023-12-22 02:29:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 539 states have (on average 1.137291280148423) internal successors, (613), 547 states have internal predecessors, (613), 78 states have call successors, (78), 53 states have call predecessors, (78), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 771 transitions. [2023-12-22 02:29:13,503 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 771 transitions. Word has length 123 [2023-12-22 02:29:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,503 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 771 transitions. [2023-12-22 02:29:13,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 771 transitions. [2023-12-22 02:29:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-22 02:29:13,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,504 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:13,510 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 (27)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:13,708 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-22 02:29:13,708 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:13,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1884255268, now seen corresponding path program 1 times [2023-12-22 02:29:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543979969] [2023-12-22 02:29:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:13,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:13,710 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-22 02:29:13,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-22 02:29:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:13,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:13,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543979969] [2023-12-22 02:29:13,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543979969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915207641] [2023-12-22 02:29:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:13,805 INFO L87 Difference]: Start difference. First operand 674 states and 771 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:29:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,871 INFO L93 Difference]: Finished difference Result 1202 states and 1389 transitions. [2023-12-22 02:29:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2023-12-22 02:29:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,881 INFO L225 Difference]: With dead ends: 1202 [2023-12-22 02:29:13,881 INFO L226 Difference]: Without dead ends: 674 [2023-12-22 02:29:13,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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-22 02:29:13,883 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 95 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:13,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 236 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-12-22 02:29:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2023-12-22 02:29:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 539 states have (on average 1.1224489795918366) internal successors, (605), 547 states have internal predecessors, (605), 78 states have call successors, (78), 53 states have call predecessors, (78), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 763 transitions. [2023-12-22 02:29:13,931 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 763 transitions. Word has length 124 [2023-12-22 02:29:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,931 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 763 transitions. [2023-12-22 02:29:13,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:29:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 763 transitions. [2023-12-22 02:29:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-22 02:29:13,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,933 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:13,940 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-22 02:29:14,136 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-22 02:29:14,137 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:14,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1493277068, now seen corresponding path program 1 times [2023-12-22 02:29:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747492089] [2023-12-22 02:29:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:14,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-22 02:29:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:14,139 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-22 02:29:14,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 (29)] Waiting until timeout for monitored process [2023-12-22 02:29:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:14,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:29:14,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-22 02:29:14,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747492089] [2023-12-22 02:29:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747492089] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:14,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709524274] [2023-12-22 02:29:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:14,373 INFO L87 Difference]: Start difference. First operand 674 states and 763 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,512 INFO L93 Difference]: Finished difference Result 678 states and 766 transitions. [2023-12-22 02:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 125 [2023-12-22 02:29:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,514 INFO L225 Difference]: With dead ends: 678 [2023-12-22 02:29:14,514 INFO L226 Difference]: Without dead ends: 675 [2023-12-22 02:29:14,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 246 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-22 02:29:14,515 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 191 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:14,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 341 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-12-22 02:29:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2023-12-22 02:29:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 539 states have (on average 1.1187384044526902) internal successors, (603), 546 states have internal predecessors, (603), 77 states have call successors, (77), 53 states have call predecessors, (77), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 760 transitions. [2023-12-22 02:29:14,565 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 760 transitions. Word has length 125 [2023-12-22 02:29:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:14,565 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 760 transitions. [2023-12-22 02:29:14,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 760 transitions. [2023-12-22 02:29:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-22 02:29:14,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:14,566 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:14,570 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-22 02:29:14,770 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-22 02:29:14,770 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:14,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1655734244, now seen corresponding path program 1 times [2023-12-22 02:29:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997405029] [2023-12-22 02:29:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:14,771 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-22 02:29:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:14,772 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-22 02:29:14,772 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-22 02:29:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:14,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-22 02:29:14,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:14,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997405029] [2023-12-22 02:29:14,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997405029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:14,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:14,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696378000] [2023-12-22 02:29:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:14,841 INFO L87 Difference]: Start difference. First operand 673 states and 760 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-22 02:29:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,928 INFO L93 Difference]: Finished difference Result 1082 states and 1224 transitions. [2023-12-22 02:29:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 129 [2023-12-22 02:29:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,930 INFO L225 Difference]: With dead ends: 1082 [2023-12-22 02:29:14,930 INFO L226 Difference]: Without dead ends: 683 [2023-12-22 02:29:14,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-22 02:29:14,932 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 236 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-22 02:29:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 675. [2023-12-22 02:29:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 541 states have (on average 1.1182994454713493) internal successors, (605), 548 states have internal predecessors, (605), 77 states have call successors, (77), 53 states have call predecessors, (77), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 762 transitions. [2023-12-22 02:29:14,996 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 762 transitions. Word has length 129 [2023-12-22 02:29:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:14,996 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 762 transitions. [2023-12-22 02:29:14,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-22 02:29:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 762 transitions. [2023-12-22 02:29:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-22 02:29:14,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:14,997 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 02:29:15,006 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-22 02:29:15,201 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-22 02:29:15,201 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:15,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1441011305, now seen corresponding path program 1 times [2023-12-22 02:29:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:15,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783075230] [2023-12-22 02:29:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:15,202 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-22 02:29:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:15,203 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-22 02:29:15,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 (31)] Waiting until timeout for monitored process [2023-12-22 02:29:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:29:15,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-22 02:29:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:29:15,364 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-22 02:29:15,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-22 02:29:15,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:29:15,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:29:15,372 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-22 02:29:15,570 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-22 02:29:15,573 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-22 02:29:15,577 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:29:15,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:29:15 BoogieIcfgContainer [2023-12-22 02:29:15,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:29:15,669 INFO L158 Benchmark]: Toolchain (without parser) took 16326.03ms. Allocated memory was 201.3MB in the beginning and 598.7MB in the end (delta: 397.4MB). Free memory was 167.6MB in the beginning and 458.4MB in the end (delta: -290.8MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.41ms. Allocated memory is still 201.3MB. Free memory was 167.4MB in the beginning and 150.2MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 147.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: Boogie Preprocessor took 43.55ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 143.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: RCFGBuilder took 526.08ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 109.9MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,669 INFO L158 Benchmark]: TraceAbstraction took 15483.04ms. Allocated memory was 201.3MB in the beginning and 598.7MB in the end (delta: 397.4MB). Free memory was 109.3MB in the beginning and 458.4MB in the end (delta: -349.1MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2023-12-22 02:29:15,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.41ms. Allocated memory is still 201.3MB. Free memory was 167.4MB in the beginning and 150.2MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 147.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.55ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 143.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 526.08ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 109.9MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15483.04ms. Allocated memory was 201.3MB in the beginning and 598.7MB in the end (delta: 397.4MB). Free memory was 109.3MB in the beginning and 458.4MB in the end (delta: -349.1MB). Peak memory consumption was 48.8MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L602-L613] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE, EXPR \read(tmp_ndt_2) [L621] EXPR t1_st = 1 [L622] CALL, EXPR transmit1() [L470] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET, EXPR transmit1() [L616-L627] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE, EXPR \read(tmp_ndt_1) [L607] EXPR m_st = 1 [L608] CALL, EXPR master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L425] COND TRUE 1 [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L431] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L608] RET, EXPR master() [L602-L613] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE, EXPR \read(tmp_ndt_2) [L621] EXPR t1_st = 1 [L622] CALL, EXPR transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 [L489] token += 1 [L490] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET, EXPR transmit1() [L616-L627] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L417] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L439] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L444] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 30, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4530 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4449 mSDsluCounter, 11294 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5598 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2620 IncrementalHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 5696 mSDtfsCounter, 2620 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2453 GetRequests, 2394 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1868occurred in iteration=21, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 691 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2357 NumberOfCodeBlocks, 2357 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2441 ConstructedInterpolants, 0 QuantifiedInterpolants, 4162 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4853 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 844/884 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-22 02:29:15,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...