/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:33:35,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:33:35,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 01:33:35,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:33:35,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:33:35,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:33:35,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:33:35,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:33:35,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:33:35,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:33:35,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:33:35,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:33:35,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:33:35,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:33:35,376 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:33:35,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:33:35,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:33:35,377 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:33:35,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:33:35,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:33:35,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:33:35,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:33:35,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:33:35,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:33:35,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:33:35,382 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:33:35,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:33:35,383 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:33:35,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:33:35,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:33:35,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:33:35,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:33:35,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:33:35,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:33:35,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:33:35,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:33:35,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:33:35,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:33:35,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:33:35,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:33:35,386 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:33:35,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:33:35,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:33:35,387 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 01:33:35,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:33:35,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:33:35,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:33:35,607 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:33:35,608 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:33:35,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-12-19 01:33:36,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:33:36,817 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:33:36,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-12-19 01:33:36,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bf7367a/0c5409b4662c4ad68ef256fd553358cd/FLAG71f665fe8 [2023-12-19 01:33:36,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bf7367a/0c5409b4662c4ad68ef256fd553358cd [2023-12-19 01:33:36,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:33:36,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:33:36,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:33:36,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:33:36,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:33:36,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:33:36" (1/1) ... [2023-12-19 01:33:36,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad0e487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:36, skipping insertion in model container [2023-12-19 01:33:36,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:33:36" (1/1) ... [2023-12-19 01:33:36,889 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:33:37,017 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-12-19 01:33:37,070 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-12-19 01:33:37,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:33:37,110 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:33:37,118 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-12-19 01:33:37,135 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-12-19 01:33:37,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:33:37,165 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:33:37,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37 WrapperNode [2023-12-19 01:33:37,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:33:37,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:33:37,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:33:37,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:33:37,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,204 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 414 [2023-12-19 01:33:37,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:33:37,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:33:37,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:33:37,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:33:37,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,242 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-19 01:33:37,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:33:37,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:33:37,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:33:37,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:33:37,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (1/1) ... [2023-12-19 01:33:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:33:37,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:37,313 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-19 01:33:37,344 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-19 01:33:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:33:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:33:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:33:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:33:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:33:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:33:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:33:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:33:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:33:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:33:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:33:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:33:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:33:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:33:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:33:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:33:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:33:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:33:37,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:33:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:33:37,355 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:33:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-12-19 01:33:37,355 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-12-19 01:33:37,457 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:33:37,459 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:33:37,842 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:33:37,875 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:33:37,875 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-19 01:33:37,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:33:37 BoogieIcfgContainer [2023-12-19 01:33:37,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:33:37,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:33:37,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:33:37,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:33:37,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:33:36" (1/3) ... [2023-12-19 01:33:37,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bb5046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:33:37, skipping insertion in model container [2023-12-19 01:33:37,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:37" (2/3) ... [2023-12-19 01:33:37,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bb5046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:33:37, skipping insertion in model container [2023-12-19 01:33:37,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:33:37" (3/3) ... [2023-12-19 01:33:37,882 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-12-19 01:33:37,894 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:33:37,894 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:33:37,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:33:37,950 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;@30bcb592, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:33:37,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:33:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 145 states have (on average 1.6275862068965516) internal successors, (236), 153 states have internal predecessors, (236), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 01:33:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-19 01:33:37,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:37,971 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-19 01:33:37,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:37,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1328399088, now seen corresponding path program 1 times [2023-12-19 01:33:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615314317] [2023-12-19 01:33:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,358 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-19 01:33:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615314317] [2023-12-19 01:33:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615314317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696760894] [2023-12-19 01:33:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:38,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:38,416 INFO L87 Difference]: Start difference. First operand has 194 states, 145 states have (on average 1.6275862068965516) internal successors, (236), 153 states have internal predecessors, (236), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:39,120 INFO L93 Difference]: Finished difference Result 503 states and 783 transitions. [2023-12-19 01:33:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:39,140 INFO L225 Difference]: With dead ends: 503 [2023-12-19 01:33:39,140 INFO L226 Difference]: Without dead ends: 318 [2023-12-19 01:33:39,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:33:39,151 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 503 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:39,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 542 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-12-19 01:33:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 277. [2023-12-19 01:33:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 214 states have (on average 1.5046728971962617) internal successors, (322), 220 states have internal predecessors, (322), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2023-12-19 01:33:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2023-12-19 01:33:39,206 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 52 [2023-12-19 01:33:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:39,206 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2023-12-19 01:33:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2023-12-19 01:33:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-19 01:33:39,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:39,208 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-19 01:33:39,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:33:39,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:39,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1795400300, now seen corresponding path program 1 times [2023-12-19 01:33:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202465569] [2023-12-19 01:33:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,344 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-19 01:33:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202465569] [2023-12-19 01:33:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202465569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945580618] [2023-12-19 01:33:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:39,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:39,347 INFO L87 Difference]: Start difference. First operand 277 states and 403 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:40,009 INFO L93 Difference]: Finished difference Result 606 states and 889 transitions. [2023-12-19 01:33:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:33:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:40,016 INFO L225 Difference]: With dead ends: 606 [2023-12-19 01:33:40,017 INFO L226 Difference]: Without dead ends: 424 [2023-12-19 01:33:40,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:33:40,024 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 487 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:40,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 862 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-12-19 01:33:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2023-12-19 01:33:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 281 states have (on average 1.498220640569395) internal successors, (421), 288 states have internal predecessors, (421), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2023-12-19 01:33:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 524 transitions. [2023-12-19 01:33:40,083 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 524 transitions. Word has length 52 [2023-12-19 01:33:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:40,083 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 524 transitions. [2023-12-19 01:33:40,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 524 transitions. [2023-12-19 01:33:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-19 01:33:40,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:40,091 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-19 01:33:40,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:33:40,091 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:40,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2075920274, now seen corresponding path program 1 times [2023-12-19 01:33:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824406886] [2023-12-19 01:33:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,239 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-19 01:33:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824406886] [2023-12-19 01:33:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824406886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656118054] [2023-12-19 01:33:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:40,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:40,245 INFO L87 Difference]: Start difference. First operand 361 states and 524 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:40,983 INFO L93 Difference]: Finished difference Result 931 states and 1360 transitions. [2023-12-19 01:33:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:33:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:40,990 INFO L225 Difference]: With dead ends: 931 [2023-12-19 01:33:40,990 INFO L226 Difference]: Without dead ends: 665 [2023-12-19 01:33:40,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:40,993 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 499 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:40,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 853 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:33:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-19 01:33:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 526. [2023-12-19 01:33:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 414 states have (on average 1.4927536231884058) internal successors, (618), 423 states have internal predecessors, (618), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-12-19 01:33:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2023-12-19 01:33:41,048 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 52 [2023-12-19 01:33:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:41,048 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2023-12-19 01:33:41,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2023-12-19 01:33:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-19 01:33:41,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:41,049 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-19 01:33:41,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:33:41,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:41,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 847239724, now seen corresponding path program 1 times [2023-12-19 01:33:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:41,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067978120] [2023-12-19 01:33:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,179 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-19 01:33:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067978120] [2023-12-19 01:33:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067978120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801278470] [2023-12-19 01:33:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:41,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:41,183 INFO L87 Difference]: Start difference. First operand 526 states and 765 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:41,941 INFO L93 Difference]: Finished difference Result 2364 states and 3544 transitions. [2023-12-19 01:33:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:33:41,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:41,953 INFO L225 Difference]: With dead ends: 2364 [2023-12-19 01:33:41,953 INFO L226 Difference]: Without dead ends: 1934 [2023-12-19 01:33:41,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:33:41,961 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 908 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:41,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 705 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2023-12-19 01:33:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1614. [2023-12-19 01:33:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1259 states have (on average 1.4360603653693407) internal successors, (1808), 1295 states have internal predecessors, (1808), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2023-12-19 01:33:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2321 transitions. [2023-12-19 01:33:42,083 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2321 transitions. Word has length 52 [2023-12-19 01:33:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:42,083 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2321 transitions. [2023-12-19 01:33:42,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-19 01:33:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2321 transitions. [2023-12-19 01:33:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:42,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:42,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:42,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:33:42,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:42,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2042303814, now seen corresponding path program 1 times [2023-12-19 01:33:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320305870] [2023-12-19 01:33:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,190 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-19 01:33:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320305870] [2023-12-19 01:33:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320305870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252722318] [2023-12-19 01:33:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:42,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:42,192 INFO L87 Difference]: Start difference. First operand 1614 states and 2321 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:42,724 INFO L93 Difference]: Finished difference Result 1820 states and 2619 transitions. [2023-12-19 01:33:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:33:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-19 01:33:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:42,731 INFO L225 Difference]: With dead ends: 1820 [2023-12-19 01:33:42,731 INFO L226 Difference]: Without dead ends: 1739 [2023-12-19 01:33:42,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:42,733 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 639 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:42,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 614 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-19 01:33:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1702. [2023-12-19 01:33:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1327 states have (on average 1.4355689525244912) internal successors, (1905), 1365 states have internal predecessors, (1905), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2023-12-19 01:33:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2445 transitions. [2023-12-19 01:33:42,808 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2445 transitions. Word has length 58 [2023-12-19 01:33:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:42,808 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 2445 transitions. [2023-12-19 01:33:42,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2445 transitions. [2023-12-19 01:33:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:42,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:42,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:42,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:33:42,810 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:42,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1908070150, now seen corresponding path program 1 times [2023-12-19 01:33:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022682557] [2023-12-19 01:33:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,926 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-19 01:33:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022682557] [2023-12-19 01:33:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022682557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46084521] [2023-12-19 01:33:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:42,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:42,927 INFO L87 Difference]: Start difference. First operand 1702 states and 2445 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:43,534 INFO L93 Difference]: Finished difference Result 2022 states and 2895 transitions. [2023-12-19 01:33:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:33:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-19 01:33:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:43,542 INFO L225 Difference]: With dead ends: 2022 [2023-12-19 01:33:43,542 INFO L226 Difference]: Without dead ends: 1860 [2023-12-19 01:33:43,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:33:43,544 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 513 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:43,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 973 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2023-12-19 01:33:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1790. [2023-12-19 01:33:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1395 states have (on average 1.4344086021505376) internal successors, (2001), 1435 states have internal predecessors, (2001), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2023-12-19 01:33:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2571 transitions. [2023-12-19 01:33:43,635 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2571 transitions. Word has length 58 [2023-12-19 01:33:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:43,635 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 2571 transitions. [2023-12-19 01:33:43,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2571 transitions. [2023-12-19 01:33:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:43,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:43,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:43,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:33:43,637 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:43,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash -458624444, now seen corresponding path program 1 times [2023-12-19 01:33:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969153529] [2023-12-19 01:33:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:43,767 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-19 01:33:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969153529] [2023-12-19 01:33:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969153529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654113039] [2023-12-19 01:33:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:43,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:43,768 INFO L87 Difference]: Start difference. First operand 1790 states and 2571 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:44,368 INFO L93 Difference]: Finished difference Result 2066 states and 2960 transitions. [2023-12-19 01:33:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:33:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-19 01:33:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:44,377 INFO L225 Difference]: With dead ends: 2066 [2023-12-19 01:33:44,377 INFO L226 Difference]: Without dead ends: 1822 [2023-12-19 01:33:44,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:33:44,380 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 201 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:44,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1019 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2023-12-19 01:33:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1794. [2023-12-19 01:33:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1398 states have (on average 1.4320457796852646) internal successors, (2002), 1438 states have internal predecessors, (2002), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2023-12-19 01:33:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2573 transitions. [2023-12-19 01:33:44,505 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2573 transitions. Word has length 58 [2023-12-19 01:33:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:44,505 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 2573 transitions. [2023-12-19 01:33:44,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2573 transitions. [2023-12-19 01:33:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:44,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:44,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:33:44,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:44,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1592359554, now seen corresponding path program 1 times [2023-12-19 01:33:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904866782] [2023-12-19 01:33:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:44,634 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-19 01:33:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904866782] [2023-12-19 01:33:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904866782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:44,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:44,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 01:33:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920058249] [2023-12-19 01:33:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:44,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:33:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:33:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:44,637 INFO L87 Difference]: Start difference. First operand 1794 states and 2573 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:33:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:45,837 INFO L93 Difference]: Finished difference Result 3018 states and 4271 transitions. [2023-12-19 01:33:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:33:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-12-19 01:33:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:45,846 INFO L225 Difference]: With dead ends: 3018 [2023-12-19 01:33:45,846 INFO L226 Difference]: Without dead ends: 2752 [2023-12-19 01:33:45,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 01:33:45,849 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 1824 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:45,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 1041 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:33:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2023-12-19 01:33:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2629. [2023-12-19 01:33:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2047 states have (on average 1.404494382022472) internal successors, (2875), 2102 states have internal predecessors, (2875), 320 states have call successors, (320), 226 states have call predecessors, (320), 260 states have return successors, (453), 306 states have call predecessors, (453), 316 states have call successors, (453) [2023-12-19 01:33:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3648 transitions. [2023-12-19 01:33:45,976 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3648 transitions. Word has length 58 [2023-12-19 01:33:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:45,977 INFO L495 AbstractCegarLoop]: Abstraction has 2629 states and 3648 transitions. [2023-12-19 01:33:45,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:33:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3648 transitions. [2023-12-19 01:33:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:45,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:45,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:45,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:33:45,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:45,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 517310348, now seen corresponding path program 1 times [2023-12-19 01:33:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699057974] [2023-12-19 01:33:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,114 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-19 01:33:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699057974] [2023-12-19 01:33:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699057974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187455267] [2023-12-19 01:33:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:46,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:46,116 INFO L87 Difference]: Start difference. First operand 2629 states and 3648 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:46,621 INFO L93 Difference]: Finished difference Result 3822 states and 5223 transitions. [2023-12-19 01:33:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:33:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-12-19 01:33:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:46,630 INFO L225 Difference]: With dead ends: 3822 [2023-12-19 01:33:46,630 INFO L226 Difference]: Without dead ends: 2727 [2023-12-19 01:33:46,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:46,633 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 203 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:46,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1016 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2023-12-19 01:33:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2653. [2023-12-19 01:33:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2065 states have (on average 1.397094430992736) internal successors, (2885), 2120 states have internal predecessors, (2885), 320 states have call successors, (320), 226 states have call predecessors, (320), 266 states have return successors, (459), 312 states have call predecessors, (459), 316 states have call successors, (459) [2023-12-19 01:33:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3664 transitions. [2023-12-19 01:33:46,796 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3664 transitions. Word has length 59 [2023-12-19 01:33:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:46,796 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 3664 transitions. [2023-12-19 01:33:46,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3664 transitions. [2023-12-19 01:33:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:46,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:46,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:46,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:33:46,798 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:46,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428914, now seen corresponding path program 1 times [2023-12-19 01:33:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:46,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990723906] [2023-12-19 01:33:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,915 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-19 01:33:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990723906] [2023-12-19 01:33:46,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990723906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:46,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:46,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205615551] [2023-12-19 01:33:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:46,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:46,917 INFO L87 Difference]: Start difference. First operand 2653 states and 3664 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:47,574 INFO L93 Difference]: Finished difference Result 3803 states and 5106 transitions. [2023-12-19 01:33:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:33:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-19 01:33:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:47,586 INFO L225 Difference]: With dead ends: 3803 [2023-12-19 01:33:47,586 INFO L226 Difference]: Without dead ends: 2891 [2023-12-19 01:33:47,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:33:47,589 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 641 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:47,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 629 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2023-12-19 01:33:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2598. [2023-12-19 01:33:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2026 states have (on average 1.395360315893386) internal successors, (2827), 2076 states have internal predecessors, (2827), 314 states have call successors, (314), 221 states have call predecessors, (314), 256 states have return successors, (444), 305 states have call predecessors, (444), 310 states have call successors, (444) [2023-12-19 01:33:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3585 transitions. [2023-12-19 01:33:47,749 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3585 transitions. Word has length 59 [2023-12-19 01:33:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:47,750 INFO L495 AbstractCegarLoop]: Abstraction has 2598 states and 3585 transitions. [2023-12-19 01:33:47,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3585 transitions. [2023-12-19 01:33:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:47,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:47,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:47,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:33:47,757 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:47,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1635574196, now seen corresponding path program 1 times [2023-12-19 01:33:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:47,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150518685] [2023-12-19 01:33:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:47,817 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-19 01:33:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:47,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150518685] [2023-12-19 01:33:47,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150518685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987442942] [2023-12-19 01:33:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:47,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:47,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:47,819 INFO L87 Difference]: Start difference. First operand 2598 states and 3585 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:48,311 INFO L93 Difference]: Finished difference Result 4747 states and 6356 transitions. [2023-12-19 01:33:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:33:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-19 01:33:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:48,349 INFO L225 Difference]: With dead ends: 4747 [2023-12-19 01:33:48,349 INFO L226 Difference]: Without dead ends: 3684 [2023-12-19 01:33:48,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:33:48,352 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 503 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:48,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 612 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2023-12-19 01:33:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3568. [2023-12-19 01:33:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3568 states, 2753 states have (on average 1.3534326189611332) internal successors, (3726), 2820 states have internal predecessors, (3726), 433 states have call successors, (433), 320 states have call predecessors, (433), 380 states have return successors, (635), 433 states have call predecessors, (635), 429 states have call successors, (635) [2023-12-19 01:33:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4794 transitions. [2023-12-19 01:33:48,554 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4794 transitions. Word has length 59 [2023-12-19 01:33:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:48,555 INFO L495 AbstractCegarLoop]: Abstraction has 3568 states and 4794 transitions. [2023-12-19 01:33:48,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:33:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4794 transitions. [2023-12-19 01:33:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:33:48,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:48,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:48,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:33:48,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:48,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1520117023, now seen corresponding path program 1 times [2023-12-19 01:33:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136285651] [2023-12-19 01:33:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,601 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-19 01:33:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136285651] [2023-12-19 01:33:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136285651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946048419] [2023-12-19 01:33:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:48,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:48,602 INFO L87 Difference]: Start difference. First operand 3568 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:49,130 INFO L93 Difference]: Finished difference Result 6620 states and 8675 transitions. [2023-12-19 01:33:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-12-19 01:33:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:49,147 INFO L225 Difference]: With dead ends: 6620 [2023-12-19 01:33:49,147 INFO L226 Difference]: Without dead ends: 4592 [2023-12-19 01:33:49,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:33:49,153 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 370 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:49,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 588 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2023-12-19 01:33:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4334. [2023-12-19 01:33:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 3333 states have (on average 1.336033603360336) internal successors, (4453), 3405 states have internal predecessors, (4453), 525 states have call successors, (525), 400 states have call predecessors, (525), 474 states have return successors, (749), 534 states have call predecessors, (749), 521 states have call successors, (749) [2023-12-19 01:33:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5727 transitions. [2023-12-19 01:33:49,514 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 5727 transitions. Word has length 60 [2023-12-19 01:33:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:49,514 INFO L495 AbstractCegarLoop]: Abstraction has 4334 states and 5727 transitions. [2023-12-19 01:33:49,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 5727 transitions. [2023-12-19 01:33:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-19 01:33:49,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:49,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:49,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:33:49,517 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:49,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 475131326, now seen corresponding path program 1 times [2023-12-19 01:33:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661961994] [2023-12-19 01:33:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,580 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-19 01:33:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661961994] [2023-12-19 01:33:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661961994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094924882] [2023-12-19 01:33:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:49,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:49,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:49,583 INFO L87 Difference]: Start difference. First operand 4334 states and 5727 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:50,137 INFO L93 Difference]: Finished difference Result 7898 states and 10193 transitions. [2023-12-19 01:33:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-12-19 01:33:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:50,166 INFO L225 Difference]: With dead ends: 7898 [2023-12-19 01:33:50,167 INFO L226 Difference]: Without dead ends: 5102 [2023-12-19 01:33:50,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:33:50,174 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 598 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:50,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 438 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2023-12-19 01:33:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4838. [2023-12-19 01:33:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 3723 states have (on average 1.327692720923986) internal successors, (4943), 3799 states have internal predecessors, (4943), 581 states have call successors, (581), 450 states have call predecessors, (581), 532 states have return successors, (822), 594 states have call predecessors, (822), 577 states have call successors, (822) [2023-12-19 01:33:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 6346 transitions. [2023-12-19 01:33:50,466 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 6346 transitions. Word has length 66 [2023-12-19 01:33:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:50,466 INFO L495 AbstractCegarLoop]: Abstraction has 4838 states and 6346 transitions. [2023-12-19 01:33:50,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:33:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 6346 transitions. [2023-12-19 01:33:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-19 01:33:50,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:50,468 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:50,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:33:50,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:50,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1328016874, now seen corresponding path program 1 times [2023-12-19 01:33:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328379044] [2023-12-19 01:33:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:33:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328379044] [2023-12-19 01:33:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328379044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849863865] [2023-12-19 01:33:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:50,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:50,519 INFO L87 Difference]: Start difference. First operand 4838 states and 6346 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:33:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:51,142 INFO L93 Difference]: Finished difference Result 5846 states and 7563 transitions. [2023-12-19 01:33:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:33:51,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-12-19 01:33:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:51,155 INFO L225 Difference]: With dead ends: 5846 [2023-12-19 01:33:51,155 INFO L226 Difference]: Without dead ends: 5843 [2023-12-19 01:33:51,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:33:51,158 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 856 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:51,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 414 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2023-12-19 01:33:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 5258. [2023-12-19 01:33:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5258 states, 4036 states have (on average 1.3173934588701686) internal successors, (5317), 4115 states have internal predecessors, (5317), 631 states have call successors, (631), 494 states have call predecessors, (631), 589 states have return successors, (899), 654 states have call predecessors, (899), 628 states have call successors, (899) [2023-12-19 01:33:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 6847 transitions. [2023-12-19 01:33:51,590 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 6847 transitions. Word has length 67 [2023-12-19 01:33:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:51,590 INFO L495 AbstractCegarLoop]: Abstraction has 5258 states and 6847 transitions. [2023-12-19 01:33:51,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:33:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 6847 transitions. [2023-12-19 01:33:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-19 01:33:51,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:51,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:51,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 01:33:51,592 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:51,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1781806200, now seen corresponding path program 1 times [2023-12-19 01:33:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659442059] [2023-12-19 01:33:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:33:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659442059] [2023-12-19 01:33:51,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659442059] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483124398] [2023-12-19 01:33:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:51,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:51,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:51,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:33:51,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 01:33:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 01:33:51,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:33:51,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:33:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:33:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483124398] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:33:52,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:33:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-12-19 01:33:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486785505] [2023-12-19 01:33:52,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:33:52,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:33:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:33:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:52,026 INFO L87 Difference]: Start difference. First operand 5258 states and 6847 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 01:33:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:53,461 INFO L93 Difference]: Finished difference Result 9230 states and 11710 transitions. [2023-12-19 01:33:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 01:33:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2023-12-19 01:33:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:53,487 INFO L225 Difference]: With dead ends: 9230 [2023-12-19 01:33:53,488 INFO L226 Difference]: Without dead ends: 9227 [2023-12-19 01:33:53,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-12-19 01:33:53,493 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 1016 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:53,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1075 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:33:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2023-12-19 01:33:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 8375. [2023-12-19 01:33:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8375 states, 6411 states have (on average 1.294649820620808) internal successors, (8300), 6525 states have internal predecessors, (8300), 990 states have call successors, (990), 808 states have call predecessors, (990), 972 states have return successors, (1400), 1047 states have call predecessors, (1400), 987 states have call successors, (1400) [2023-12-19 01:33:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 10690 transitions. [2023-12-19 01:33:54,079 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 10690 transitions. Word has length 68 [2023-12-19 01:33:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:54,079 INFO L495 AbstractCegarLoop]: Abstraction has 8375 states and 10690 transitions. [2023-12-19 01:33:54,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 01:33:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 10690 transitions. [2023-12-19 01:33:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 01:33:54,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:54,081 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 01:33:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-19 01:33:54,287 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1137729558, now seen corresponding path program 2 times [2023-12-19 01:33:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12006854] [2023-12-19 01:33:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:33:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12006854] [2023-12-19 01:33:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12006854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053184485] [2023-12-19 01:33:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:54,340 INFO L87 Difference]: Start difference. First operand 8375 states and 10690 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:33:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:54,992 INFO L93 Difference]: Finished difference Result 10763 states and 13693 transitions. [2023-12-19 01:33:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:33:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-12-19 01:33:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:55,010 INFO L225 Difference]: With dead ends: 10763 [2023-12-19 01:33:55,010 INFO L226 Difference]: Without dead ends: 5125 [2023-12-19 01:33:55,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:55,019 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 423 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:55,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 591 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2023-12-19 01:33:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4189. [2023-12-19 01:33:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 3231 states have (on average 1.3163107397090683) internal successors, (4253), 3291 states have internal predecessors, (4253), 509 states have call successors, (509), 390 states have call predecessors, (509), 447 states have return successors, (699), 513 states have call predecessors, (699), 506 states have call successors, (699) [2023-12-19 01:33:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 5461 transitions. [2023-12-19 01:33:55,390 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 5461 transitions. Word has length 71 [2023-12-19 01:33:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:55,390 INFO L495 AbstractCegarLoop]: Abstraction has 4189 states and 5461 transitions. [2023-12-19 01:33:55,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:33:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 5461 transitions. [2023-12-19 01:33:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-19 01:33:55,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:55,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:55,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 01:33:55,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:55,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1976505401, now seen corresponding path program 1 times [2023-12-19 01:33:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:55,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933239015] [2023-12-19 01:33:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:33:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:33:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933239015] [2023-12-19 01:33:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933239015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:55,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:55,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:55,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521497895] [2023-12-19 01:33:55,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:55,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:55,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:55,467 INFO L87 Difference]: Start difference. First operand 4189 states and 5461 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:33:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:56,457 INFO L93 Difference]: Finished difference Result 9507 states and 11992 transitions. [2023-12-19 01:33:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 01:33:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-12-19 01:33:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:56,474 INFO L225 Difference]: With dead ends: 9507 [2023-12-19 01:33:56,474 INFO L226 Difference]: Without dead ends: 6117 [2023-12-19 01:33:56,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-12-19 01:33:56,481 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 956 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:56,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 680 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2023-12-19 01:33:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 5857. [2023-12-19 01:33:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5857 states, 4464 states have (on average 1.2780017921146953) internal successors, (5705), 4561 states have internal predecessors, (5705), 709 states have call successors, (709), 562 states have call predecessors, (709), 682 states have return successors, (1049), 739 states have call predecessors, (1049), 706 states have call successors, (1049) [2023-12-19 01:33:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 7463 transitions. [2023-12-19 01:33:56,876 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 7463 transitions. Word has length 76 [2023-12-19 01:33:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:56,877 INFO L495 AbstractCegarLoop]: Abstraction has 5857 states and 7463 transitions. [2023-12-19 01:33:56,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:33:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 7463 transitions. [2023-12-19 01:33:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-19 01:33:56,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:56,885 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-19 01:33:56,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 01:33:56,885 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:56,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash -816846335, now seen corresponding path program 1 times [2023-12-19 01:33:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448760224] [2023-12-19 01:33:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:33:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:33:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:33:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448760224] [2023-12-19 01:33:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448760224] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317681672] [2023-12-19 01:33:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:56,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:33:56,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 01:33:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:33:57,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:57,058 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-19 01:33:57,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:57,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317681672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:57,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:57,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253578291] [2023-12-19 01:33:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:57,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:57,060 INFO L87 Difference]: Start difference. First operand 5857 states and 7463 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 01:33:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:57,601 INFO L93 Difference]: Finished difference Result 8701 states and 11644 transitions. [2023-12-19 01:33:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:57,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 84 [2023-12-19 01:33:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:57,628 INFO L225 Difference]: With dead ends: 8701 [2023-12-19 01:33:57,629 INFO L226 Difference]: Without dead ends: 7184 [2023-12-19 01:33:57,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:57,636 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:57,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 587 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7184 states. [2023-12-19 01:33:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7184 to 7184. [2023-12-19 01:33:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7184 states, 5507 states have (on average 1.2981659705828945) internal successors, (7149), 5621 states have internal predecessors, (7149), 868 states have call successors, (868), 668 states have call predecessors, (868), 807 states have return successors, (1348), 904 states have call predecessors, (1348), 865 states have call successors, (1348) [2023-12-19 01:33:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 9365 transitions. [2023-12-19 01:33:58,138 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 9365 transitions. Word has length 84 [2023-12-19 01:33:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:58,139 INFO L495 AbstractCegarLoop]: Abstraction has 7184 states and 9365 transitions. [2023-12-19 01:33:58,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 01:33:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 9365 transitions. [2023-12-19 01:33:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 01:33:58,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:58,144 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:33:58,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 01:33:58,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-19 01:33:58,350 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:58,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2055529371, now seen corresponding path program 1 times [2023-12-19 01:33:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603368087] [2023-12-19 01:33:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-19 01:33:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:33:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603368087] [2023-12-19 01:33:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603368087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025310222] [2023-12-19 01:33:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:58,456 INFO L87 Difference]: Start difference. First operand 7184 states and 9365 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:33:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:59,663 INFO L93 Difference]: Finished difference Result 10274 states and 13113 transitions. [2023-12-19 01:33:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 01:33:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2023-12-19 01:33:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:59,680 INFO L225 Difference]: With dead ends: 10274 [2023-12-19 01:33:59,681 INFO L226 Difference]: Without dead ends: 6431 [2023-12-19 01:33:59,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-19 01:33:59,689 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1019 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 946 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6431 states. [2023-12-19 01:34:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6431 to 6027. [2023-12-19 01:34:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 4616 states have (on average 1.3011265164644714) internal successors, (6006), 4718 states have internal predecessors, (6006), 733 states have call successors, (733), 550 states have call predecessors, (733), 676 states have return successors, (1117), 768 states have call predecessors, (1117), 730 states have call successors, (1117) [2023-12-19 01:34:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 7856 transitions. [2023-12-19 01:34:00,196 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 7856 transitions. Word has length 86 [2023-12-19 01:34:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:00,196 INFO L495 AbstractCegarLoop]: Abstraction has 6027 states and 7856 transitions. [2023-12-19 01:34:00,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:34:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 7856 transitions. [2023-12-19 01:34:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 01:34:00,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:00,202 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 01:34:00,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:00,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1198985313, now seen corresponding path program 1 times [2023-12-19 01:34:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018268624] [2023-12-19 01:34:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:34:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 01:34:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 01:34:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-19 01:34:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018268624] [2023-12-19 01:34:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018268624] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502603705] [2023-12-19 01:34:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:00,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:00,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 01:34:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:00,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:00,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:34:00,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502603705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:34:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930515099] [2023-12-19 01:34:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:00,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:00,445 INFO L87 Difference]: Start difference. First operand 6027 states and 7856 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-19 01:34:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:00,896 INFO L93 Difference]: Finished difference Result 9618 states and 13127 transitions. [2023-12-19 01:34:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:00,896 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-19 01:34:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:00,916 INFO L225 Difference]: With dead ends: 9618 [2023-12-19 01:34:00,916 INFO L226 Difference]: Without dead ends: 7452 [2023-12-19 01:34:00,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:00,924 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 199 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:00,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 383 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2023-12-19 01:34:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7408. [2023-12-19 01:34:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7408 states, 5707 states have (on average 1.3215349570702646) internal successors, (7542), 5830 states have internal predecessors, (7542), 897 states have call successors, (897), 660 states have call predecessors, (897), 802 states have return successors, (1361), 927 states have call predecessors, (1361), 894 states have call successors, (1361) [2023-12-19 01:34:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 9800 transitions. [2023-12-19 01:34:01,382 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 9800 transitions. Word has length 107 [2023-12-19 01:34:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:01,382 INFO L495 AbstractCegarLoop]: Abstraction has 7408 states and 9800 transitions. [2023-12-19 01:34:01,382 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-19 01:34:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 9800 transitions. [2023-12-19 01:34:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 01:34:01,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:01,391 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] [2023-12-19 01:34:01,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:01,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:01,597 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:01,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -956017786, now seen corresponding path program 1 times [2023-12-19 01:34:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859091482] [2023-12-19 01:34:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:34:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:34:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:34:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:34:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:34:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:01,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859091482] [2023-12-19 01:34:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859091482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572771687] [2023-12-19 01:34:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:01,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:01,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:01,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:01,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 01:34:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:01,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:34:01,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572771687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:01,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100868154] [2023-12-19 01:34:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:01,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:01,781 INFO L87 Difference]: Start difference. First operand 7408 states and 9800 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:34:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:02,242 INFO L93 Difference]: Finished difference Result 12036 states and 16649 transitions. [2023-12-19 01:34:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 122 [2023-12-19 01:34:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:02,265 INFO L225 Difference]: With dead ends: 12036 [2023-12-19 01:34:02,266 INFO L226 Difference]: Without dead ends: 7812 [2023-12-19 01:34:02,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:02,278 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:02,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 267 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2023-12-19 01:34:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 7717. [2023-12-19 01:34:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7717 states, 5991 states have (on average 1.28509430812886) internal successors, (7699), 6109 states have internal predecessors, (7699), 893 states have call successors, (893), 686 states have call predecessors, (893), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-12-19 01:34:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 9935 transitions. [2023-12-19 01:34:02,801 INFO L78 Accepts]: Start accepts. Automaton has 7717 states and 9935 transitions. Word has length 122 [2023-12-19 01:34:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:02,801 INFO L495 AbstractCegarLoop]: Abstraction has 7717 states and 9935 transitions. [2023-12-19 01:34:02,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:34:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7717 states and 9935 transitions. [2023-12-19 01:34:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 01:34:02,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:02,808 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] [2023-12-19 01:34:02,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 01:34:03,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:03,028 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:03,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 895698313, now seen corresponding path program 1 times [2023-12-19 01:34:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787552557] [2023-12-19 01:34:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:34:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:34:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:34:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:34:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-19 01:34:03,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:03,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787552557] [2023-12-19 01:34:03,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787552557] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199850504] [2023-12-19 01:34:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:03,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:03,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:03,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 01:34:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:34:03,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:34:03,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199850504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:03,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:03,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:03,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594146511] [2023-12-19 01:34:03,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:03,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:03,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:03,221 INFO L87 Difference]: Start difference. First operand 7717 states and 9935 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:34:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:03,722 INFO L93 Difference]: Finished difference Result 12157 states and 16026 transitions. [2023-12-19 01:34:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2023-12-19 01:34:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:03,744 INFO L225 Difference]: With dead ends: 12157 [2023-12-19 01:34:03,745 INFO L226 Difference]: Without dead ends: 7932 [2023-12-19 01:34:03,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:03,756 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 212 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:03,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 383 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2023-12-19 01:34:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7687. [2023-12-19 01:34:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7687 states, 5961 states have (on average 1.2714309679583962) internal successors, (7579), 6079 states have internal predecessors, (7579), 893 states have call successors, (893), 686 states have call predecessors, (893), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-12-19 01:34:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7687 states to 7687 states and 9815 transitions. [2023-12-19 01:34:04,285 INFO L78 Accepts]: Start accepts. Automaton has 7687 states and 9815 transitions. Word has length 122 [2023-12-19 01:34:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:04,285 INFO L495 AbstractCegarLoop]: Abstraction has 7687 states and 9815 transitions. [2023-12-19 01:34:04,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:34:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7687 states and 9815 transitions. [2023-12-19 01:34:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 01:34:04,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:04,292 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, 1] [2023-12-19 01:34:04,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-19 01:34:04,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-19 01:34:04,500 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:04,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 766176521, now seen corresponding path program 1 times [2023-12-19 01:34:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008529223] [2023-12-19 01:34:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:34:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:34:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:34:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:34:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:34:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008529223] [2023-12-19 01:34:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008529223] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073252337] [2023-12-19 01:34:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:04,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:04,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 01:34:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:04,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:34:04,675 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073252337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065874799] [2023-12-19 01:34:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:04,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:04,677 INFO L87 Difference]: Start difference. First operand 7687 states and 9815 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:34:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:05,397 INFO L93 Difference]: Finished difference Result 16401 states and 21767 transitions. [2023-12-19 01:34:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-19 01:34:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:05,428 INFO L225 Difference]: With dead ends: 16401 [2023-12-19 01:34:05,428 INFO L226 Difference]: Without dead ends: 11902 [2023-12-19 01:34:05,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:05,439 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 117 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:05,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 583 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2023-12-19 01:34:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 11898. [2023-12-19 01:34:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11898 states, 9286 states have (on average 1.2747146241654104) internal successors, (11837), 9469 states have internal predecessors, (11837), 1381 states have call successors, (1381), 1036 states have call predecessors, (1381), 1229 states have return successors, (2339), 1410 states have call predecessors, (2339), 1378 states have call successors, (2339) [2023-12-19 01:34:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11898 states to 11898 states and 15557 transitions. [2023-12-19 01:34:06,212 INFO L78 Accepts]: Start accepts. Automaton has 11898 states and 15557 transitions. Word has length 123 [2023-12-19 01:34:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:06,212 INFO L495 AbstractCegarLoop]: Abstraction has 11898 states and 15557 transitions. [2023-12-19 01:34:06,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:34:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11898 states and 15557 transitions. [2023-12-19 01:34:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:34:06,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:06,226 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, 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-19 01:34:06,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:06,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:06,427 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:06,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1622899648, now seen corresponding path program 1 times [2023-12-19 01:34:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709534635] [2023-12-19 01:34:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:34:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-19 01:34:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709534635] [2023-12-19 01:34:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709534635] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806064739] [2023-12-19 01:34:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:06,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:06,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:06,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 01:34:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:34:06,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 01:34:06,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806064739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106123277] [2023-12-19 01:34:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:06,648 INFO L87 Difference]: Start difference. First operand 11898 states and 15557 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:34:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:07,324 INFO L93 Difference]: Finished difference Result 15150 states and 20307 transitions. [2023-12-19 01:34:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:07,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2023-12-19 01:34:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:07,354 INFO L225 Difference]: With dead ends: 15150 [2023-12-19 01:34:07,355 INFO L226 Difference]: Without dead ends: 10796 [2023-12-19 01:34:07,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:07,368 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:07,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 547 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10796 states. [2023-12-19 01:34:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10796 to 10664. [2023-12-19 01:34:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10664 states, 8318 states have (on average 1.2620822313056024) internal successors, (10498), 8485 states have internal predecessors, (10498), 1237 states have call successors, (1237), 936 states have call predecessors, (1237), 1107 states have return successors, (1999), 1260 states have call predecessors, (1999), 1234 states have call successors, (1999) [2023-12-19 01:34:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 13734 transitions. [2023-12-19 01:34:08,079 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 13734 transitions. Word has length 124 [2023-12-19 01:34:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:08,079 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 13734 transitions. [2023-12-19 01:34:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:34:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 13734 transitions. [2023-12-19 01:34:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 01:34:08,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:08,090 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, 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] [2023-12-19 01:34:08,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:08,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:08,297 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:08,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1600264158, now seen corresponding path program 1 times [2023-12-19 01:34:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322199084] [2023-12-19 01:34:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:34:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322199084] [2023-12-19 01:34:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322199084] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463031555] [2023-12-19 01:34:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:08,364 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:08,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 01:34:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:34:08,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-19 01:34:08,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463031555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:08,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:34:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288854057] [2023-12-19 01:34:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:08,516 INFO L87 Difference]: Start difference. First operand 10664 states and 13734 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:09,258 INFO L93 Difference]: Finished difference Result 13824 states and 18104 transitions. [2023-12-19 01:34:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-19 01:34:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:09,279 INFO L225 Difference]: With dead ends: 13824 [2023-12-19 01:34:09,279 INFO L226 Difference]: Without dead ends: 9164 [2023-12-19 01:34:09,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:09,286 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 295 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:09,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 360 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2023-12-19 01:34:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 9104. [2023-12-19 01:34:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9104 states, 7078 states have (on average 1.2309974569087312) internal successors, (8713), 7199 states have internal predecessors, (8713), 1077 states have call successors, (1077), 816 states have call predecessors, (1077), 947 states have return successors, (1626), 1098 states have call predecessors, (1626), 1074 states have call successors, (1626) [2023-12-19 01:34:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 11416 transitions. [2023-12-19 01:34:09,859 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 11416 transitions. Word has length 125 [2023-12-19 01:34:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:09,859 INFO L495 AbstractCegarLoop]: Abstraction has 9104 states and 11416 transitions. [2023-12-19 01:34:09,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 11416 transitions. [2023-12-19 01:34:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 01:34:09,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:09,866 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, 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] [2023-12-19 01:34:09,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:34:10,071 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:10,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1075728224, now seen corresponding path program 1 times [2023-12-19 01:34:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:10,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561948623] [2023-12-19 01:34:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:10,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:34:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561948623] [2023-12-19 01:34:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561948623] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:10,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490828228] [2023-12-19 01:34:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:10,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:10,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 01:34:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:34:10,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-19 01:34:10,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490828228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:10,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:34:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297510475] [2023-12-19 01:34:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:10,351 INFO L87 Difference]: Start difference. First operand 9104 states and 11416 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:11,162 INFO L93 Difference]: Finished difference Result 14130 states and 18158 transitions. [2023-12-19 01:34:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:34:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-19 01:34:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:11,185 INFO L225 Difference]: With dead ends: 14130 [2023-12-19 01:34:11,186 INFO L226 Difference]: Without dead ends: 8478 [2023-12-19 01:34:11,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:11,196 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 313 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:11,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 355 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8478 states. [2023-12-19 01:34:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8478 to 6622. [2023-12-19 01:34:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6622 states, 5132 states have (on average 1.1971940763834763) internal successors, (6144), 5221 states have internal predecessors, (6144), 777 states have call successors, (777), 600 states have call predecessors, (777), 711 states have return successors, (1147), 806 states have call predecessors, (1147), 774 states have call successors, (1147) [2023-12-19 01:34:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 8068 transitions. [2023-12-19 01:34:11,699 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 8068 transitions. Word has length 125 [2023-12-19 01:34:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:11,700 INFO L495 AbstractCegarLoop]: Abstraction has 6622 states and 8068 transitions. [2023-12-19 01:34:11,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 8068 transitions. [2023-12-19 01:34:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 01:34:11,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:11,706 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, 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] [2023-12-19 01:34:11,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-19 01:34:11,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-19 01:34:11,913 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:11,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 192219234, now seen corresponding path program 1 times [2023-12-19 01:34:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060344096] [2023-12-19 01:34:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:34:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060344096] [2023-12-19 01:34:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060344096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84321036] [2023-12-19 01:34:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:11,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:11,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:12,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 01:34:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:12,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:34:12,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:34:12,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84321036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:34:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828188488] [2023-12-19 01:34:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:34:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:34:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:12,080 INFO L87 Difference]: Start difference. First operand 6622 states and 8068 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 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-19 01:34:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:12,537 INFO L93 Difference]: Finished difference Result 9026 states and 11168 transitions. [2023-12-19 01:34:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 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 125 [2023-12-19 01:34:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:12,546 INFO L225 Difference]: With dead ends: 9026 [2023-12-19 01:34:12,546 INFO L226 Difference]: Without dead ends: 5039 [2023-12-19 01:34:12,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:12,551 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 11 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:12,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2023-12-19 01:34:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2023-12-19 01:34:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5039 states, 3877 states have (on average 1.1859685323703895) internal successors, (4598), 3948 states have internal predecessors, (4598), 587 states have call successors, (587), 470 states have call predecessors, (587), 573 states have return successors, (804), 624 states have call predecessors, (804), 584 states have call successors, (804) [2023-12-19 01:34:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 5989 transitions. [2023-12-19 01:34:12,903 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 5989 transitions. Word has length 125 [2023-12-19 01:34:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:12,904 INFO L495 AbstractCegarLoop]: Abstraction has 5039 states and 5989 transitions. [2023-12-19 01:34:12,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 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-19 01:34:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 5989 transitions. [2023-12-19 01:34:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 01:34:12,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:12,907 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, 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-19 01:34:12,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:13,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-19 01:34:13,113 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:13,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2025413922, now seen corresponding path program 1 times [2023-12-19 01:34:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495278817] [2023-12-19 01:34:13,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-19 01:34:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495278817] [2023-12-19 01:34:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495278817] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725610511] [2023-12-19 01:34:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:13,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:13,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:13,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:13,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 01:34:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:34:13,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-19 01:34:13,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725610511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:13,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:34:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518369691] [2023-12-19 01:34:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:34:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:34:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:13,328 INFO L87 Difference]: Start difference. First operand 5039 states and 5989 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 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-19 01:34:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:13,681 INFO L93 Difference]: Finished difference Result 6134 states and 7319 transitions. [2023-12-19 01:34:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 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 125 [2023-12-19 01:34:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:13,690 INFO L225 Difference]: With dead ends: 6134 [2023-12-19 01:34:13,690 INFO L226 Difference]: Without dead ends: 3907 [2023-12-19 01:34:13,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:13,694 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:13,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 709 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2023-12-19 01:34:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3907. [2023-12-19 01:34:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 2966 states have (on average 1.1857720836142953) internal successors, (3517), 3026 states have internal predecessors, (3517), 463 states have call successors, (463), 381 states have call predecessors, (463), 476 states have return successors, (621), 502 states have call predecessors, (621), 460 states have call successors, (621) [2023-12-19 01:34:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 4601 transitions. [2023-12-19 01:34:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 4601 transitions. Word has length 125 [2023-12-19 01:34:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:14,022 INFO L495 AbstractCegarLoop]: Abstraction has 3907 states and 4601 transitions. [2023-12-19 01:34:14,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 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-19 01:34:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 4601 transitions. [2023-12-19 01:34:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 01:34:14,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:14,025 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-19 01:34:14,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:14,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-19 01:34:14,225 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:14,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1372525982, now seen corresponding path program 1 times [2023-12-19 01:34:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623105915] [2023-12-19 01:34:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,325 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-19 01:34:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623105915] [2023-12-19 01:34:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623105915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:14,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235165994] [2023-12-19 01:34:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:14,327 INFO L87 Difference]: Start difference. First operand 3907 states and 4601 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:34:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:14,931 INFO L93 Difference]: Finished difference Result 4066 states and 4777 transitions. [2023-12-19 01:34:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:34:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2023-12-19 01:34:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:14,940 INFO L225 Difference]: With dead ends: 4066 [2023-12-19 01:34:14,940 INFO L226 Difference]: Without dead ends: 4063 [2023-12-19 01:34:14,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:14,942 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 540 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:14,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 558 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:34:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2023-12-19 01:34:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4032. [2023-12-19 01:34:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 3066 states have (on average 1.182648401826484) internal successors, (3626), 3126 states have internal predecessors, (3626), 477 states have call successors, (477), 391 states have call predecessors, (477), 487 states have return successors, (637), 517 states have call predecessors, (637), 475 states have call successors, (637) [2023-12-19 01:34:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 4740 transitions. [2023-12-19 01:34:15,290 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 4740 transitions. Word has length 125 [2023-12-19 01:34:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:15,290 INFO L495 AbstractCegarLoop]: Abstraction has 4032 states and 4740 transitions. [2023-12-19 01:34:15,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:34:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 4740 transitions. [2023-12-19 01:34:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 01:34:15,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:15,293 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 01:34:15,293 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:15,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1601398172, now seen corresponding path program 1 times [2023-12-19 01:34:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097626487] [2023-12-19 01:34:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:34:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 01:34:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 01:34:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 01:34:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 01:34:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-19 01:34:15,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097626487] [2023-12-19 01:34:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097626487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624298618] [2023-12-19 01:34:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:15,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:15,389 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:15,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 01:34:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 01:34:15,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 01:34:15,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624298618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:15,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:15,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-12-19 01:34:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972354547] [2023-12-19 01:34:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:15,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:15,492 INFO L87 Difference]: Start difference. First operand 4032 states and 4740 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 01:34:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:15,776 INFO L93 Difference]: Finished difference Result 5745 states and 6817 transitions. [2023-12-19 01:34:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-12-19 01:34:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:15,782 INFO L225 Difference]: With dead ends: 5745 [2023-12-19 01:34:15,782 INFO L226 Difference]: Without dead ends: 2585 [2023-12-19 01:34:15,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-19 01:34:15,787 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:15,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1149 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:34:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2023-12-19 01:34:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2463. [2023-12-19 01:34:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1943 states have (on average 1.1698404529078745) internal successors, (2273), 1966 states have internal predecessors, (2273), 266 states have call successors, (266), 205 states have call predecessors, (266), 252 states have return successors, (344), 292 states have call predecessors, (344), 264 states have call successors, (344) [2023-12-19 01:34:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 2883 transitions. [2023-12-19 01:34:15,968 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 2883 transitions. Word has length 131 [2023-12-19 01:34:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:15,969 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 2883 transitions. [2023-12-19 01:34:15,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 01:34:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 2883 transitions. [2023-12-19 01:34:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 01:34:15,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:15,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 01:34:15,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:16,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:16,176 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:16,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -523809464, now seen corresponding path program 1 times [2023-12-19 01:34:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618050614] [2023-12-19 01:34:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-19 01:34:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 01:34:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:34:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 01:34:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:34:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 01:34:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-19 01:34:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618050614] [2023-12-19 01:34:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618050614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863015815] [2023-12-19 01:34:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:16,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:16,230 INFO L87 Difference]: Start difference. First operand 2463 states and 2883 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:34:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:16,640 INFO L93 Difference]: Finished difference Result 2511 states and 2933 transitions. [2023-12-19 01:34:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2023-12-19 01:34:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:16,644 INFO L225 Difference]: With dead ends: 2511 [2023-12-19 01:34:16,644 INFO L226 Difference]: Without dead ends: 2171 [2023-12-19 01:34:16,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:16,645 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 285 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:16,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 503 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2023-12-19 01:34:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2126. [2023-12-19 01:34:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1690 states have (on average 1.172189349112426) internal successors, (1981), 1710 states have internal predecessors, (1981), 225 states have call successors, (225), 170 states have call predecessors, (225), 209 states have return successors, (289), 246 states have call predecessors, (289), 223 states have call successors, (289) [2023-12-19 01:34:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2495 transitions. [2023-12-19 01:34:16,832 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2495 transitions. Word has length 133 [2023-12-19 01:34:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:16,832 INFO L495 AbstractCegarLoop]: Abstraction has 2126 states and 2495 transitions. [2023-12-19 01:34:16,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:34:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2495 transitions. [2023-12-19 01:34:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-19 01:34:16,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:16,834 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-19 01:34:16,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 01:34:16,834 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:16,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1337113526, now seen corresponding path program 1 times [2023-12-19 01:34:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546490389] [2023-12-19 01:34:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,885 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-19 01:34:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546490389] [2023-12-19 01:34:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546490389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:34:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48829820] [2023-12-19 01:34:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:16,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:16,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:16,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:16,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:34:16,886 INFO L87 Difference]: Start difference. First operand 2126 states and 2495 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:17,268 INFO L93 Difference]: Finished difference Result 2690 states and 3143 transitions. [2023-12-19 01:34:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:34:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2023-12-19 01:34:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:17,272 INFO L225 Difference]: With dead ends: 2690 [2023-12-19 01:34:17,272 INFO L226 Difference]: Without dead ends: 2161 [2023-12-19 01:34:17,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-19 01:34:17,273 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 187 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:17,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 448 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2023-12-19 01:34:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2128. [2023-12-19 01:34:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1692 states have (on average 1.1719858156028369) internal successors, (1983), 1712 states have internal predecessors, (1983), 225 states have call successors, (225), 170 states have call predecessors, (225), 209 states have return successors, (289), 246 states have call predecessors, (289), 223 states have call successors, (289) [2023-12-19 01:34:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2497 transitions. [2023-12-19 01:34:17,487 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2497 transitions. Word has length 129 [2023-12-19 01:34:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:17,488 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 2497 transitions. [2023-12-19 01:34:17,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2497 transitions. [2023-12-19 01:34:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-19 01:34:17,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:17,491 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-19 01:34:17,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 01:34:17,491 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:17,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1566691016, now seen corresponding path program 1 times [2023-12-19 01:34:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959805748] [2023-12-19 01:34:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:34:17,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 01:34:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:34:17,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 01:34:17,556 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 01:34:17,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:34:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:34:17,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 01:34:17,561 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, 1, 1, 1] [2023-12-19 01:34:17,565 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:34:17,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:34:17 BoogieIcfgContainer [2023-12-19 01:34:17,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:34:17,687 INFO L158 Benchmark]: Toolchain (without parser) took 40838.73ms. Allocated memory was 252.7MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 197.9MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 118.8MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,687 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:34:17,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.89ms. Allocated memory is still 252.7MB. Free memory was 197.4MB in the beginning and 180.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.37ms. Allocated memory is still 252.7MB. Free memory was 180.1MB in the beginning and 177.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,690 INFO L158 Benchmark]: Boogie Preprocessor took 66.81ms. Allocated memory is still 252.7MB. Free memory was 177.5MB in the beginning and 174.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,690 INFO L158 Benchmark]: RCFGBuilder took 595.79ms. Allocated memory is still 252.7MB. Free memory was 174.3MB in the beginning and 141.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,692 INFO L158 Benchmark]: TraceAbstraction took 39809.69ms. Allocated memory was 252.7MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 141.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. [2023-12-19 01:34:17,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.89ms. Allocated memory is still 252.7MB. Free memory was 197.4MB in the beginning and 180.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.37ms. Allocated memory is still 252.7MB. Free memory was 180.1MB in the beginning and 177.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.81ms. Allocated memory is still 252.7MB. Free memory was 177.5MB in the beginning and 174.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.79ms. Allocated memory is still 252.7MB. Free memory was 174.3MB in the beginning and 141.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 39809.69ms. Allocated memory was 252.7MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 141.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 62.2MB. 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: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 [L919] kernel_st = 1 [L920] CALL eval2() [L694] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L708-L719] { 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 [L589] t1_pc = 1 [L590] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET, EXPR transmit1() [L722-L733] { 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L698] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE, EXPR \read(tmp_ndt_1) [L713] EXPR m_st = 1 [L714] CALL, EXPR master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET, EXPR master() [L708-L719] { 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 [L595] token += 1 [L596] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 [L589] t1_pc = 1 [L590] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET, EXPR transmit1() [L722-L733] { 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L698] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); [L701] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: 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 16 procedures, 194 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15181 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14788 mSDsluCounter, 21140 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14616 mSDsCounter, 3408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16341 IncrementalHoareTripleChecker+Invalid, 19749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3408 mSolverCounterUnsat, 6524 mSDtfsCounter, 16341 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2494 GetRequests, 2115 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11898occurred in iteration=23, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 7530 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 4322 NumberOfCodeBlocks, 4322 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4215 ConstructedInterpolants, 0 QuantifiedInterpolants, 7381 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4930 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 45 InterpolantComputations, 31 PerfectInterpolantSequences, 1552/1715 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-19 01:34:17,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...