./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:01:31,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:01:31,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 03:01:31,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:01:31,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:01:31,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:01:31,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:01:31,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:01:31,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:01:31,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:01:31,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:01:31,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:01:31,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:01:31,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:01:31,502 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:01:31,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:01:31,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:01:31,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 03:01:31,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:01:31,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 03:01:31,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:01:31,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:01:31,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:01:31,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:01:31,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:01:31,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:01:31,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:01:31,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:01:31,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:01:31,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:01:31,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:01:31,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:01:31,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:01:31,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:01:31,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:01:31,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:01:31,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:01:31,514 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2024-10-24 03:01:31,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:01:31,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:01:31,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:01:31,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:01:31,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:01:31,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-10-24 03:01:33,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:01:33,181 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:01:33,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-10-24 03:01:33,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0949fdb/b9c0aae79bfb40dda271d2d3e3f1dce9/FLAGfab180bcd [2024-10-24 03:01:33,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0949fdb/b9c0aae79bfb40dda271d2d3e3f1dce9 [2024-10-24 03:01:33,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:01:33,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:01:33,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:01:33,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:01:33,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:01:33,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:33,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8ad02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33, skipping insertion in model container [2024-10-24 03:01:33,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:33,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:01:33,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-10-24 03:01:33,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-10-24 03:01:33,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:01:33,907 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:01:33,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-10-24 03:01:33,932 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-10-24 03:01:33,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:01:33,984 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:01:33,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33 WrapperNode [2024-10-24 03:01:33,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:01:33,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:01:33,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:01:33,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:01:33,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,040 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 414 [2024-10-24 03:01:34,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:01:34,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:01:34,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:01:34,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:01:34,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,088 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]. [2024-10-24 03:01:34,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:01:34,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:01:34,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:01:34,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:01:34,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (1/1) ... [2024-10-24 03:01:34,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:01:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:01:34,144 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) [2024-10-24 03:01:34,146 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 [2024-10-24 03:01:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:01:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 03:01:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 03:01:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-24 03:01:34,190 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-24 03:01:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 03:01:34,190 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 03:01:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 03:01:34,190 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 03:01:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-24 03:01:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-24 03:01:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 03:01:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 03:01:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 03:01:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 03:01:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-24 03:01:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-24 03:01:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-24 03:01:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-24 03:01:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-24 03:01:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-24 03:01:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 03:01:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 03:01:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:01:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 03:01:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 03:01:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-24 03:01:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-24 03:01:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:01:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:01:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 03:01:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 03:01:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-24 03:01:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-24 03:01:34,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:01:34,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:01:34,673 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-24 03:01:34,673 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:01:34,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:01:34,705 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-24 03:01:34,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:01:34 BoogieIcfgContainer [2024-10-24 03:01:34,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:01:34,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:01:34,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:01:34,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:01:34,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:01:33" (1/3) ... [2024-10-24 03:01:34,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e2883b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:01:34, skipping insertion in model container [2024-10-24 03:01:34,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:33" (2/3) ... [2024-10-24 03:01:34,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e2883b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:01:34, skipping insertion in model container [2024-10-24 03:01:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:01:34" (3/3) ... [2024-10-24 03:01:34,712 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-10-24 03:01:34,725 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:01:34,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 03:01:34,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:01:34,792 INFO L333 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, 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;@6d72687e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:01:34,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 03:01:34,799 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) [2024-10-24 03:01:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 03:01:34,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:34,814 INFO L215 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] [2024-10-24 03:01:34,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1328399088, now seen corresponding path program 1 times [2024-10-24 03:01:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831953034] [2024-10-24 03:01:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831953034] [2024-10-24 03:01:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831953034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:35,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608183814] [2024-10-24 03:01:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:35,299 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) [2024-10-24 03:01:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:36,007 INFO L93 Difference]: Finished difference Result 503 states and 783 transitions. [2024-10-24 03:01:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:36,013 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 [2024-10-24 03:01:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:36,027 INFO L225 Difference]: With dead ends: 503 [2024-10-24 03:01:36,028 INFO L226 Difference]: Without dead ends: 318 [2024-10-24 03:01:36,033 INFO L431 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 [2024-10-24 03:01:36,039 INFO L432 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.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:36,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 542 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:01:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-24 03:01:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 277. [2024-10-24 03:01:36,134 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) [2024-10-24 03:01:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2024-10-24 03:01:36,139 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 52 [2024-10-24 03:01:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:36,140 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2024-10-24 03:01:36,140 INFO L472 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) [2024-10-24 03:01:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2024-10-24 03:01:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 03:01:36,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:36,146 INFO L215 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] [2024-10-24 03:01:36,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:01:36,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:36,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1795400300, now seen corresponding path program 1 times [2024-10-24 03:01:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462947718] [2024-10-24 03:01:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462947718] [2024-10-24 03:01:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462947718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562674954] [2024-10-24 03:01:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:36,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:36,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:36,339 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) [2024-10-24 03:01:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:37,139 INFO L93 Difference]: Finished difference Result 606 states and 889 transitions. [2024-10-24 03:01:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:37,141 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 [2024-10-24 03:01:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:37,147 INFO L225 Difference]: With dead ends: 606 [2024-10-24 03:01:37,147 INFO L226 Difference]: Without dead ends: 424 [2024-10-24 03:01:37,149 INFO L431 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 [2024-10-24 03:01:37,150 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 487 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:37,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 862 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:01:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-24 03:01:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2024-10-24 03:01:37,199 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) [2024-10-24 03:01:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 524 transitions. [2024-10-24 03:01:37,202 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 524 transitions. Word has length 52 [2024-10-24 03:01:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 524 transitions. [2024-10-24 03:01:37,203 INFO L472 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) [2024-10-24 03:01:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 524 transitions. [2024-10-24 03:01:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 03:01:37,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:37,207 INFO L215 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] [2024-10-24 03:01:37,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:01:37,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:37,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2075920274, now seen corresponding path program 1 times [2024-10-24 03:01:37,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:37,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098442505] [2024-10-24 03:01:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098442505] [2024-10-24 03:01:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098442505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835972108] [2024-10-24 03:01:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:37,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:37,337 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) [2024-10-24 03:01:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:38,155 INFO L93 Difference]: Finished difference Result 931 states and 1360 transitions. [2024-10-24 03:01:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:01:38,156 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 [2024-10-24 03:01:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:38,162 INFO L225 Difference]: With dead ends: 931 [2024-10-24 03:01:38,162 INFO L226 Difference]: Without dead ends: 665 [2024-10-24 03:01:38,163 INFO L431 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 [2024-10-24 03:01:38,164 INFO L432 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 [2024-10-24 03:01:38,164 INFO L433 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] [2024-10-24 03:01:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-10-24 03:01:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 526. [2024-10-24 03:01:38,198 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) [2024-10-24 03:01:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2024-10-24 03:01:38,202 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 52 [2024-10-24 03:01:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:38,203 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2024-10-24 03:01:38,203 INFO L472 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) [2024-10-24 03:01:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2024-10-24 03:01:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 03:01:38,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:38,205 INFO L215 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] [2024-10-24 03:01:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:01:38,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 847239724, now seen corresponding path program 1 times [2024-10-24 03:01:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201609215] [2024-10-24 03:01:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201609215] [2024-10-24 03:01:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201609215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830472442] [2024-10-24 03:01:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:38,326 INFO L87 Difference]: Start difference. First operand 526 states and 765 transitions. 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) [2024-10-24 03:01:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:38,730 INFO L93 Difference]: Finished difference Result 1039 states and 1537 transitions. [2024-10-24 03:01:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:38,731 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 [2024-10-24 03:01:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:38,734 INFO L225 Difference]: With dead ends: 1039 [2024-10-24 03:01:38,734 INFO L226 Difference]: Without dead ends: 609 [2024-10-24 03:01:38,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:01:38,736 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 197 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:38,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 634 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:01:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-24 03:01:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 536. [2024-10-24 03:01:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.4811320754716981) internal successors, (628), 433 states have internal predecessors, (628), 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) [2024-10-24 03:01:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 775 transitions. [2024-10-24 03:01:38,795 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 775 transitions. Word has length 52 [2024-10-24 03:01:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:38,797 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 775 transitions. [2024-10-24 03:01:38,797 INFO L472 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) [2024-10-24 03:01:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 775 transitions. [2024-10-24 03:01:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 03:01:38,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:38,798 INFO L215 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] [2024-10-24 03:01:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:01:38,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1548839598, now seen corresponding path program 1 times [2024-10-24 03:01:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517964309] [2024-10-24 03:01:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:38,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517964309] [2024-10-24 03:01:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517964309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:38,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394325194] [2024-10-24 03:01:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:38,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:38,912 INFO L87 Difference]: Start difference. First operand 536 states and 775 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) [2024-10-24 03:01:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:39,847 INFO L93 Difference]: Finished difference Result 2304 states and 3434 transitions. [2024-10-24 03:01:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 03:01:39,847 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 [2024-10-24 03:01:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:39,856 INFO L225 Difference]: With dead ends: 2304 [2024-10-24 03:01:39,857 INFO L226 Difference]: Without dead ends: 1864 [2024-10-24 03:01:39,860 INFO L431 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 [2024-10-24 03:01:39,861 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 982 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:39,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 686 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:01:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-10-24 03:01:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1624. [2024-10-24 03:01:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1269 states have (on average 1.42080378250591) internal successors, (1803), 1305 states have internal predecessors, (1803), 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) [2024-10-24 03:01:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2316 transitions. [2024-10-24 03:01:39,948 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2316 transitions. Word has length 52 [2024-10-24 03:01:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2316 transitions. [2024-10-24 03:01:39,948 INFO L472 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) [2024-10-24 03:01:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2316 transitions. [2024-10-24 03:01:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:39,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:39,949 INFO L215 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] [2024-10-24 03:01:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:01:39,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2042303814, now seen corresponding path program 1 times [2024-10-24 03:01:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318896070] [2024-10-24 03:01:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318896070] [2024-10-24 03:01:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318896070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016088902] [2024-10-24 03:01:40,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:40,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:40,094 INFO L87 Difference]: Start difference. First operand 1624 states and 2316 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) [2024-10-24 03:01:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:40,684 INFO L93 Difference]: Finished difference Result 1830 states and 2614 transitions. [2024-10-24 03:01:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:40,685 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 [2024-10-24 03:01:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:40,691 INFO L225 Difference]: With dead ends: 1830 [2024-10-24 03:01:40,692 INFO L226 Difference]: Without dead ends: 1749 [2024-10-24 03:01:40,693 INFO L431 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 [2024-10-24 03:01:40,696 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 636 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:40,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 614 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:01:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-10-24 03:01:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1712. [2024-10-24 03:01:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1337 states have (on average 1.4210919970082274) internal successors, (1900), 1375 states have internal predecessors, (1900), 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) [2024-10-24 03:01:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2440 transitions. [2024-10-24 03:01:40,799 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2440 transitions. Word has length 58 [2024-10-24 03:01:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:40,799 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2440 transitions. [2024-10-24 03:01:40,800 INFO L472 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) [2024-10-24 03:01:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2440 transitions. [2024-10-24 03:01:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:40,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:40,801 INFO L215 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] [2024-10-24 03:01:40,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 03:01:40,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:40,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1908070150, now seen corresponding path program 1 times [2024-10-24 03:01:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425181681] [2024-10-24 03:01:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425181681] [2024-10-24 03:01:40,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425181681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:40,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:40,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:40,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031390193] [2024-10-24 03:01:40,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:40,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:40,919 INFO L87 Difference]: Start difference. First operand 1712 states and 2440 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) [2024-10-24 03:01:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:41,747 INFO L93 Difference]: Finished difference Result 2032 states and 2890 transitions. [2024-10-24 03:01:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:01:41,748 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 [2024-10-24 03:01:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:41,755 INFO L225 Difference]: With dead ends: 2032 [2024-10-24 03:01:41,756 INFO L226 Difference]: Without dead ends: 1870 [2024-10-24 03:01:41,757 INFO L431 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 [2024-10-24 03:01:41,759 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 531 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:41,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 973 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:01:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-24 03:01:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1800. [2024-10-24 03:01:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1405 states have (on average 1.4206405693950177) internal successors, (1996), 1445 states have internal predecessors, (1996), 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) [2024-10-24 03:01:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2566 transitions. [2024-10-24 03:01:41,890 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2566 transitions. Word has length 58 [2024-10-24 03:01:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2566 transitions. [2024-10-24 03:01:41,890 INFO L472 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) [2024-10-24 03:01:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2566 transitions. [2024-10-24 03:01:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:41,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:41,892 INFO L215 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] [2024-10-24 03:01:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 03:01:41,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -458624444, now seen corresponding path program 1 times [2024-10-24 03:01:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766847975] [2024-10-24 03:01:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766847975] [2024-10-24 03:01:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766847975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:42,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:42,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:01:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001057017] [2024-10-24 03:01:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:42,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:01:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:01:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:01:42,004 INFO L87 Difference]: Start difference. First operand 1800 states and 2566 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) [2024-10-24 03:01:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:42,625 INFO L93 Difference]: Finished difference Result 2074 states and 2952 transitions. [2024-10-24 03:01:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:42,626 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 [2024-10-24 03:01:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:42,634 INFO L225 Difference]: With dead ends: 2074 [2024-10-24 03:01:42,634 INFO L226 Difference]: Without dead ends: 1830 [2024-10-24 03:01:42,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:01:42,637 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 286 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:42,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 913 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:01:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-10-24 03:01:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1804. [2024-10-24 03:01:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1408 states have (on average 1.4183238636363635) internal successors, (1997), 1448 states have internal predecessors, (1997), 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) [2024-10-24 03:01:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2568 transitions. [2024-10-24 03:01:42,759 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2568 transitions. Word has length 58 [2024-10-24 03:01:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2568 transitions. [2024-10-24 03:01:42,760 INFO L472 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) [2024-10-24 03:01:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2568 transitions. [2024-10-24 03:01:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:42,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:42,762 INFO L215 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] [2024-10-24 03:01:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 03:01:42,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1592359554, now seen corresponding path program 1 times [2024-10-24 03:01:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228741448] [2024-10-24 03:01:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:42,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228741448] [2024-10-24 03:01:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228741448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 03:01:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377399441] [2024-10-24 03:01:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:42,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 03:01:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 03:01:42,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:01:42,871 INFO L87 Difference]: Start difference. First operand 1804 states and 2568 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) [2024-10-24 03:01:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:44,149 INFO L93 Difference]: Finished difference Result 3028 states and 4266 transitions. [2024-10-24 03:01:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 03:01:44,149 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 [2024-10-24 03:01:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:44,160 INFO L225 Difference]: With dead ends: 3028 [2024-10-24 03:01:44,160 INFO L226 Difference]: Without dead ends: 2762 [2024-10-24 03:01:44,163 INFO L431 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 [2024-10-24 03:01:44,163 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1818 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:44,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1041 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:01:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2024-10-24 03:01:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2639. [2024-10-24 03:01:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2057 states have (on average 1.3952357802625182) internal successors, (2870), 2112 states have internal predecessors, (2870), 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) [2024-10-24 03:01:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3643 transitions. [2024-10-24 03:01:44,375 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3643 transitions. Word has length 58 [2024-10-24 03:01:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:44,376 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 3643 transitions. [2024-10-24 03:01:44,376 INFO L472 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) [2024-10-24 03:01:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3643 transitions. [2024-10-24 03:01:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 03:01:44,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:44,377 INFO L215 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] [2024-10-24 03:01:44,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 03:01:44,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 517310348, now seen corresponding path program 1 times [2024-10-24 03:01:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388077857] [2024-10-24 03:01:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:44,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388077857] [2024-10-24 03:01:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388077857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:01:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959928033] [2024-10-24 03:01:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:44,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:01:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:01:44,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:01:44,483 INFO L87 Difference]: Start difference. First operand 2639 states and 3643 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) [2024-10-24 03:01:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:45,118 INFO L93 Difference]: Finished difference Result 3828 states and 5214 transitions. [2024-10-24 03:01:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:01:45,118 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 [2024-10-24 03:01:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:45,129 INFO L225 Difference]: With dead ends: 3828 [2024-10-24 03:01:45,129 INFO L226 Difference]: Without dead ends: 2733 [2024-10-24 03:01:45,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:01:45,132 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 293 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:45,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 910 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:01:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2024-10-24 03:01:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2663. [2024-10-24 03:01:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2075 states have (on average 1.3879518072289156) internal successors, (2880), 2130 states have internal predecessors, (2880), 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) [2024-10-24 03:01:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3659 transitions. [2024-10-24 03:01:45,318 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3659 transitions. Word has length 59 [2024-10-24 03:01:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:45,318 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3659 transitions. [2024-10-24 03:01:45,318 INFO L472 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) [2024-10-24 03:01:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3659 transitions. [2024-10-24 03:01:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 03:01:45,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:45,320 INFO L215 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] [2024-10-24 03:01:45,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 03:01:45,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428914, now seen corresponding path program 1 times [2024-10-24 03:01:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943110389] [2024-10-24 03:01:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943110389] [2024-10-24 03:01:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943110389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994999901] [2024-10-24 03:01:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:45,445 INFO L87 Difference]: Start difference. First operand 2663 states and 3659 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) [2024-10-24 03:01:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:46,199 INFO L93 Difference]: Finished difference Result 3813 states and 5101 transitions. [2024-10-24 03:01:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:01:46,200 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 [2024-10-24 03:01:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:46,211 INFO L225 Difference]: With dead ends: 3813 [2024-10-24 03:01:46,211 INFO L226 Difference]: Without dead ends: 2901 [2024-10-24 03:01:46,215 INFO L431 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 [2024-10-24 03:01:46,215 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 647 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:46,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 629 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:01:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-10-24 03:01:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2608. [2024-10-24 03:01:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2036 states have (on average 1.3860510805500983) internal successors, (2822), 2086 states have internal predecessors, (2822), 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) [2024-10-24 03:01:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 3580 transitions. [2024-10-24 03:01:46,417 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 3580 transitions. Word has length 59 [2024-10-24 03:01:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 3580 transitions. [2024-10-24 03:01:46,418 INFO L472 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) [2024-10-24 03:01:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3580 transitions. [2024-10-24 03:01:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 03:01:46,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:46,420 INFO L215 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] [2024-10-24 03:01:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 03:01:46,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:46,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1635574196, now seen corresponding path program 1 times [2024-10-24 03:01:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208642040] [2024-10-24 03:01:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208642040] [2024-10-24 03:01:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208642040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966145649] [2024-10-24 03:01:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:46,510 INFO L87 Difference]: Start difference. First operand 2608 states and 3580 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) [2024-10-24 03:01:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:47,138 INFO L93 Difference]: Finished difference Result 4757 states and 6351 transitions. [2024-10-24 03:01:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:01:47,138 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 [2024-10-24 03:01:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:47,151 INFO L225 Difference]: With dead ends: 4757 [2024-10-24 03:01:47,151 INFO L226 Difference]: Without dead ends: 3694 [2024-10-24 03:01:47,154 INFO L431 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 [2024-10-24 03:01:47,155 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 634 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:47,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 513 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:01:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-24 03:01:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3578. [2024-10-24 03:01:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 2763 states have (on average 1.346724574737604) internal successors, (3721), 2830 states have internal predecessors, (3721), 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) [2024-10-24 03:01:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4789 transitions. [2024-10-24 03:01:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4789 transitions. Word has length 59 [2024-10-24 03:01:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 3578 states and 4789 transitions. [2024-10-24 03:01:47,544 INFO L472 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) [2024-10-24 03:01:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4789 transitions. [2024-10-24 03:01:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 03:01:47,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:47,546 INFO L215 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] [2024-10-24 03:01:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 03:01:47,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:47,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1520117023, now seen corresponding path program 1 times [2024-10-24 03:01:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865734923] [2024-10-24 03:01:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865734923] [2024-10-24 03:01:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865734923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893038918] [2024-10-24 03:01:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:47,615 INFO L87 Difference]: Start difference. First operand 3578 states and 4789 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) [2024-10-24 03:01:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:48,263 INFO L93 Difference]: Finished difference Result 6630 states and 8670 transitions. [2024-10-24 03:01:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:48,264 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 [2024-10-24 03:01:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:48,280 INFO L225 Difference]: With dead ends: 6630 [2024-10-24 03:01:48,280 INFO L226 Difference]: Without dead ends: 4602 [2024-10-24 03:01:48,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:48,286 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 500 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:48,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 482 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:01:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2024-10-24 03:01:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4344. [2024-10-24 03:01:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4344 states, 3343 states have (on average 1.330541429853425) internal successors, (4448), 3415 states have internal predecessors, (4448), 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) [2024-10-24 03:01:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 5722 transitions. [2024-10-24 03:01:48,654 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 5722 transitions. Word has length 60 [2024-10-24 03:01:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:48,654 INFO L471 AbstractCegarLoop]: Abstraction has 4344 states and 5722 transitions. [2024-10-24 03:01:48,654 INFO L472 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) [2024-10-24 03:01:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 5722 transitions. [2024-10-24 03:01:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 03:01:48,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:48,658 INFO L215 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] [2024-10-24 03:01:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:01:48,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 475131326, now seen corresponding path program 1 times [2024-10-24 03:01:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42616091] [2024-10-24 03:01:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42616091] [2024-10-24 03:01:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42616091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318805438] [2024-10-24 03:01:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:48,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:48,714 INFO L87 Difference]: Start difference. First operand 4344 states and 5722 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) [2024-10-24 03:01:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:49,529 INFO L93 Difference]: Finished difference Result 7908 states and 10188 transitions. [2024-10-24 03:01:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:49,530 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 [2024-10-24 03:01:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:49,548 INFO L225 Difference]: With dead ends: 7908 [2024-10-24 03:01:49,548 INFO L226 Difference]: Without dead ends: 5112 [2024-10-24 03:01:49,557 INFO L431 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 [2024-10-24 03:01:49,558 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 475 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:49,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 552 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:01:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2024-10-24 03:01:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 4848. [2024-10-24 03:01:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4848 states, 3733 states have (on average 1.322796678274846) internal successors, (4938), 3809 states have internal predecessors, (4938), 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) [2024-10-24 03:01:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 6341 transitions. [2024-10-24 03:01:49,973 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 6341 transitions. Word has length 66 [2024-10-24 03:01:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:49,973 INFO L471 AbstractCegarLoop]: Abstraction has 4848 states and 6341 transitions. [2024-10-24 03:01:49,974 INFO L472 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) [2024-10-24 03:01:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 6341 transitions. [2024-10-24 03:01:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 03:01:49,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:49,976 INFO L215 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] [2024-10-24 03:01:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:01:49,976 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1328016874, now seen corresponding path program 1 times [2024-10-24 03:01:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621096253] [2024-10-24 03:01:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621096253] [2024-10-24 03:01:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621096253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:50,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:50,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938664851] [2024-10-24 03:01:50,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:50,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:50,041 INFO L87 Difference]: Start difference. First operand 4848 states and 6341 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) [2024-10-24 03:01:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:50,923 INFO L93 Difference]: Finished difference Result 5856 states and 7558 transitions. [2024-10-24 03:01:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 03:01:50,924 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 [2024-10-24 03:01:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:50,944 INFO L225 Difference]: With dead ends: 5856 [2024-10-24 03:01:50,945 INFO L226 Difference]: Without dead ends: 5853 [2024-10-24 03:01:50,947 INFO L431 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 [2024-10-24 03:01:50,949 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 856 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2024-10-24 03:01:50,949 INFO L433 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] [2024-10-24 03:01:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2024-10-24 03:01:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5268. [2024-10-24 03:01:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 4046 states have (on average 1.3129016312407316) internal successors, (5312), 4125 states have internal predecessors, (5312), 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) [2024-10-24 03:01:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 6842 transitions. [2024-10-24 03:01:51,549 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 6842 transitions. Word has length 67 [2024-10-24 03:01:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:51,550 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 6842 transitions. [2024-10-24 03:01:51,550 INFO L472 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) [2024-10-24 03:01:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 6842 transitions. [2024-10-24 03:01:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 03:01:51,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:51,552 INFO L215 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] [2024-10-24 03:01:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 03:01:51,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:51,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1781806200, now seen corresponding path program 1 times [2024-10-24 03:01:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086786753] [2024-10-24 03:01:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086786753] [2024-10-24 03:01:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086786753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:01:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166126674] [2024-10-24 03:01:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:51,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:01:51,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:01:51,693 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) [2024-10-24 03:01:51,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 03:01:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 03:01:51,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:01:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:51,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:01:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166126674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:01:52,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:01:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-24 03:01:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838987590] [2024-10-24 03:01:52,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:01:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 03:01:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 03:01:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:01:52,051 INFO L87 Difference]: Start difference. First operand 5268 states and 6842 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) [2024-10-24 03:01:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:53,932 INFO L93 Difference]: Finished difference Result 9240 states and 11705 transitions. [2024-10-24 03:01:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 03:01:53,932 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 [2024-10-24 03:01:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:53,955 INFO L225 Difference]: With dead ends: 9240 [2024-10-24 03:01:53,955 INFO L226 Difference]: Without dead ends: 9237 [2024-10-24 03:01:53,958 INFO L431 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 [2024-10-24 03:01:53,958 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 1016 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:53,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1075 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:01:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9237 states. [2024-10-24 03:01:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9237 to 8385. [2024-10-24 03:01:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8385 states, 6421 states have (on average 1.2918548512692727) internal successors, (8295), 6535 states have internal predecessors, (8295), 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) [2024-10-24 03:01:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8385 states to 8385 states and 10685 transitions. [2024-10-24 03:01:54,773 INFO L78 Accepts]: Start accepts. Automaton has 8385 states and 10685 transitions. Word has length 68 [2024-10-24 03:01:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 8385 states and 10685 transitions. [2024-10-24 03:01:54,774 INFO L472 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) [2024-10-24 03:01:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8385 states and 10685 transitions. [2024-10-24 03:01:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 03:01:54,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:54,776 INFO L215 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] [2024-10-24 03:01:54,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 03:01:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 03:01:54,978 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1137729558, now seen corresponding path program 2 times [2024-10-24 03:01:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:54,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390650967] [2024-10-24 03:01:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:55,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:55,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390650967] [2024-10-24 03:01:55,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390650967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:55,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084039275] [2024-10-24 03:01:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:55,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:55,032 INFO L87 Difference]: Start difference. First operand 8385 states and 10685 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) [2024-10-24 03:01:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:56,184 INFO L93 Difference]: Finished difference Result 10773 states and 13688 transitions. [2024-10-24 03:01:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:01:56,184 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 [2024-10-24 03:01:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:56,207 INFO L225 Difference]: With dead ends: 10773 [2024-10-24 03:01:56,208 INFO L226 Difference]: Without dead ends: 5135 [2024-10-24 03:01:56,220 INFO L431 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 [2024-10-24 03:01:56,221 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 515 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:56,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 469 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:01:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2024-10-24 03:01:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4199. [2024-10-24 03:01:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 3241 states have (on average 1.310706572045665) internal successors, (4248), 3301 states have internal predecessors, (4248), 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) [2024-10-24 03:01:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 5456 transitions. [2024-10-24 03:01:56,833 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 5456 transitions. Word has length 71 [2024-10-24 03:01:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:56,834 INFO L471 AbstractCegarLoop]: Abstraction has 4199 states and 5456 transitions. [2024-10-24 03:01:56,834 INFO L472 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) [2024-10-24 03:01:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 5456 transitions. [2024-10-24 03:01:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 03:01:56,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:56,836 INFO L215 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] [2024-10-24 03:01:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 03:01:56,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1976505401, now seen corresponding path program 1 times [2024-10-24 03:01:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947132462] [2024-10-24 03:01:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:01:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:01:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947132462] [2024-10-24 03:01:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947132462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:56,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438448582] [2024-10-24 03:01:56,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:56,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:56,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:56,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:56,917 INFO L87 Difference]: Start difference. First operand 4199 states and 5456 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) [2024-10-24 03:01:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:58,189 INFO L93 Difference]: Finished difference Result 9517 states and 11987 transitions. [2024-10-24 03:01:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 03:01:58,189 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 [2024-10-24 03:01:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:58,208 INFO L225 Difference]: With dead ends: 9517 [2024-10-24 03:01:58,208 INFO L226 Difference]: Without dead ends: 6127 [2024-10-24 03:01:58,216 INFO L431 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 [2024-10-24 03:01:58,216 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 953 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:58,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 680 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:01:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2024-10-24 03:01:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5867. [2024-10-24 03:01:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5867 states, 4474 states have (on average 1.2740277156906572) internal successors, (5700), 4571 states have internal predecessors, (5700), 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) [2024-10-24 03:01:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 7458 transitions. [2024-10-24 03:01:58,798 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 7458 transitions. Word has length 76 [2024-10-24 03:01:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:58,799 INFO L471 AbstractCegarLoop]: Abstraction has 5867 states and 7458 transitions. [2024-10-24 03:01:58,799 INFO L472 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) [2024-10-24 03:01:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 7458 transitions. [2024-10-24 03:01:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 03:01:58,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:58,802 INFO L215 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] [2024-10-24 03:01:58,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 03:01:58,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 151960453, now seen corresponding path program 1 times [2024-10-24 03:01:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34316380] [2024-10-24 03:01:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:01:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:01:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:01:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:01:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 03:01:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:01:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34316380] [2024-10-24 03:01:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34316380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:01:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148629657] [2024-10-24 03:01:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:58,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:01:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:01:58,871 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) [2024-10-24 03:01:58,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 03:01:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:01:58,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:01:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 03:01:58,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:01:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148629657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:01:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:01:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810149779] [2024-10-24 03:01:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:01:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:01:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:58,962 INFO L87 Difference]: Start difference. First operand 5867 states and 7458 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) [2024-10-24 03:01:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:59,697 INFO L93 Difference]: Finished difference Result 8731 states and 11574 transitions. [2024-10-24 03:01:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:01:59,698 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 [2024-10-24 03:01:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:59,719 INFO L225 Difference]: With dead ends: 8731 [2024-10-24 03:01:59,719 INFO L226 Difference]: Without dead ends: 6231 [2024-10-24 03:01:59,727 INFO L431 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 [2024-10-24 03:01:59,727 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:59,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 586 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:01:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6231 states. [2024-10-24 03:02:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6231 to 6231. [2024-10-24 03:02:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6231 states, 4764 states have (on average 1.2802267002518892) internal successors, (6099), 4865 states have internal predecessors, (6099), 751 states have call successors, (751), 590 states have call predecessors, (751), 714 states have return successors, (1113), 781 states have call predecessors, (1113), 748 states have call successors, (1113) [2024-10-24 03:02:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 7963 transitions. [2024-10-24 03:02:00,339 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 7963 transitions. Word has length 84 [2024-10-24 03:02:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 6231 states and 7963 transitions. [2024-10-24 03:02:00,340 INFO L472 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) [2024-10-24 03:02:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 7963 transitions. [2024-10-24 03:02:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 03:02:00,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:00,343 INFO L215 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] [2024-10-24 03:02:00,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 03:02:00,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:00,544 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:00,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2055529371, now seen corresponding path program 1 times [2024-10-24 03:02:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:00,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243003037] [2024-10-24 03:02:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 03:02:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:02:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:00,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243003037] [2024-10-24 03:02:00,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243003037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:02:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525889132] [2024-10-24 03:02:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:00,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:02:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:02:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:02:00,642 INFO L87 Difference]: Start difference. First operand 6231 states and 7963 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) [2024-10-24 03:02:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:02,277 INFO L93 Difference]: Finished difference Result 9321 states and 11711 transitions. [2024-10-24 03:02:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 03:02:02,277 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 [2024-10-24 03:02:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:02,299 INFO L225 Difference]: With dead ends: 9321 [2024-10-24 03:02:02,299 INFO L226 Difference]: Without dead ends: 5478 [2024-10-24 03:02:02,309 INFO L431 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 [2024-10-24 03:02:02,309 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1196 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:02,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 684 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:02:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-10-24 03:02:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5074. [2024-10-24 03:02:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 3873 states have (on average 1.2796281951975212) internal successors, (4956), 3962 states have internal predecessors, (4956), 616 states have call successors, (616), 472 states have call predecessors, (616), 583 states have return successors, (882), 645 states have call predecessors, (882), 613 states have call successors, (882) [2024-10-24 03:02:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 6454 transitions. [2024-10-24 03:02:02,821 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 6454 transitions. Word has length 86 [2024-10-24 03:02:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:02,822 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 6454 transitions. [2024-10-24 03:02:02,822 INFO L472 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) [2024-10-24 03:02:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 6454 transitions. [2024-10-24 03:02:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 03:02:02,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:02,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 03:02:02,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1619220069, now seen corresponding path program 1 times [2024-10-24 03:02:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471784461] [2024-10-24 03:02:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:02:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 03:02:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 03:02:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 03:02:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471784461] [2024-10-24 03:02:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471784461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952271124] [2024-10-24 03:02:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:02,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:02,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:02,895 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) [2024-10-24 03:02:02,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 03:02:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:02,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:02:02,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 03:02:03,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952271124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:03,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:03,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 03:02:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745189597] [2024-10-24 03:02:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:03,073 INFO L87 Difference]: Start difference. First operand 5074 states and 6454 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) [2024-10-24 03:02:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:03,637 INFO L93 Difference]: Finished difference Result 7732 states and 10301 transitions. [2024-10-24 03:02:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:03,637 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 [2024-10-24 03:02:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:03,658 INFO L225 Difference]: With dead ends: 7732 [2024-10-24 03:02:03,658 INFO L226 Difference]: Without dead ends: 6200 [2024-10-24 03:02:03,664 INFO L431 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 [2024-10-24 03:02:03,665 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 198 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 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 [2024-10-24 03:02:03,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 383 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6200 states. [2024-10-24 03:02:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6200 to 6171. [2024-10-24 03:02:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6171 states, 4745 states have (on average 1.3020021074815595) internal successors, (6178), 4851 states have internal predecessors, (6178), 744 states have call successors, (744), 557 states have call predecessors, (744), 680 states have return successors, (1062), 768 states have call predecessors, (1062), 741 states have call successors, (1062) [2024-10-24 03:02:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 7984 transitions. [2024-10-24 03:02:04,257 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 7984 transitions. Word has length 107 [2024-10-24 03:02:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 6171 states and 7984 transitions. [2024-10-24 03:02:04,257 INFO L472 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) [2024-10-24 03:02:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 7984 transitions. [2024-10-24 03:02:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 03:02:04,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:04,263 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:04,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 03:02:04,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:04,464 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash -724820154, now seen corresponding path program 1 times [2024-10-24 03:02:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678590194] [2024-10-24 03:02:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 03:02:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 03:02:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 03:02:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 03:02:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-24 03:02:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678590194] [2024-10-24 03:02:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678590194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220664588] [2024-10-24 03:02:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:04,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:04,604 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) [2024-10-24 03:02:04,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 03:02:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:04,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:02:04,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 03:02:04,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220664588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:02:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859633669] [2024-10-24 03:02:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:04,704 INFO L87 Difference]: Start difference. First operand 6171 states and 7984 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) [2024-10-24 03:02:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:05,280 INFO L93 Difference]: Finished difference Result 9585 states and 12890 transitions. [2024-10-24 03:02:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:05,282 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 [2024-10-24 03:02:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:05,304 INFO L225 Difference]: With dead ends: 9585 [2024-10-24 03:02:05,304 INFO L226 Difference]: Without dead ends: 6595 [2024-10-24 03:02:05,313 INFO L431 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 [2024-10-24 03:02:05,313 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 243 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 266 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 [2024-10-24 03:02:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 266 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2024-10-24 03:02:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 6500. [2024-10-24 03:02:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 5049 states have (on average 1.2693602693602695) internal successors, (6409), 5150 states have internal predecessors, (6409), 740 states have call successors, (740), 583 states have call predecessors, (740), 709 states have return successors, (1044), 772 states have call predecessors, (1044), 737 states have call successors, (1044) [2024-10-24 03:02:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 8193 transitions. [2024-10-24 03:02:05,960 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 8193 transitions. Word has length 122 [2024-10-24 03:02:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:05,960 INFO L471 AbstractCegarLoop]: Abstraction has 6500 states and 8193 transitions. [2024-10-24 03:02:05,960 INFO L472 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) [2024-10-24 03:02:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 8193 transitions. [2024-10-24 03:02:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 03:02:05,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:05,966 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:05,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 03:02:06,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:06,168 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:06,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1126895945, now seen corresponding path program 1 times [2024-10-24 03:02:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:06,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83785697] [2024-10-24 03:02:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 03:02:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 03:02:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 03:02:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 03:02:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-24 03:02:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83785697] [2024-10-24 03:02:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83785697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570455448] [2024-10-24 03:02:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:06,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:06,245 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) [2024-10-24 03:02:06,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 03:02:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 03:02:06,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 03:02:06,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570455448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:06,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:02:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479394215] [2024-10-24 03:02:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:06,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:06,342 INFO L87 Difference]: Start difference. First operand 6500 states and 8193 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 03:02:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:06,949 INFO L93 Difference]: Finished difference Result 9892 states and 12767 transitions. [2024-10-24 03:02:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 122 [2024-10-24 03:02:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:06,975 INFO L225 Difference]: With dead ends: 9892 [2024-10-24 03:02:06,975 INFO L226 Difference]: Without dead ends: 6575 [2024-10-24 03:02:06,985 INFO L431 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 [2024-10-24 03:02:06,986 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 232 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:06,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 368 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2024-10-24 03:02:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6470. [2024-10-24 03:02:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6470 states, 5019 states have (on average 1.253038453875274) internal successors, (6289), 5120 states have internal predecessors, (6289), 740 states have call successors, (740), 583 states have call predecessors, (740), 709 states have return successors, (1044), 772 states have call predecessors, (1044), 737 states have call successors, (1044) [2024-10-24 03:02:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6470 states to 6470 states and 8073 transitions. [2024-10-24 03:02:07,725 INFO L78 Accepts]: Start accepts. Automaton has 6470 states and 8073 transitions. Word has length 122 [2024-10-24 03:02:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:07,725 INFO L471 AbstractCegarLoop]: Abstraction has 6470 states and 8073 transitions. [2024-10-24 03:02:07,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 03:02:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6470 states and 8073 transitions. [2024-10-24 03:02:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 03:02:07,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:07,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:07,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 03:02:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 03:02:07,932 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash -146591995, now seen corresponding path program 1 times [2024-10-24 03:02:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496578653] [2024-10-24 03:02:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:02:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 03:02:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:02:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 03:02:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 03:02:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496578653] [2024-10-24 03:02:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496578653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192895420] [2024-10-24 03:02:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:08,019 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) [2024-10-24 03:02:08,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 03:02:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:02:08,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 03:02:08,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192895420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:02:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18980956] [2024-10-24 03:02:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:08,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:08,124 INFO L87 Difference]: Start difference. First operand 6470 states and 8073 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) [2024-10-24 03:02:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:09,065 INFO L93 Difference]: Finished difference Result 12842 states and 16551 transitions. [2024-10-24 03:02:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:09,066 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 [2024-10-24 03:02:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:09,103 INFO L225 Difference]: With dead ends: 12842 [2024-10-24 03:02:09,104 INFO L226 Difference]: Without dead ends: 9555 [2024-10-24 03:02:09,116 INFO L431 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 [2024-10-24 03:02:09,118 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 117 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 579 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 [2024-10-24 03:02:09,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 579 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2024-10-24 03:02:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9551. [2024-10-24 03:02:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7477 states have (on average 1.2583924033703358) internal successors, (9409), 7626 states have internal predecessors, (9409), 1081 states have call successors, (1081), 833 states have call predecessors, (1081), 991 states have return successors, (1679), 1101 states have call predecessors, (1679), 1078 states have call successors, (1679) [2024-10-24 03:02:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 12169 transitions. [2024-10-24 03:02:10,434 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 12169 transitions. Word has length 123 [2024-10-24 03:02:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:10,434 INFO L471 AbstractCegarLoop]: Abstraction has 9551 states and 12169 transitions. [2024-10-24 03:02:10,434 INFO L472 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) [2024-10-24 03:02:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 12169 transitions. [2024-10-24 03:02:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 03:02:10,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:10,443 INFO L215 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] [2024-10-24 03:02:10,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 03:02:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:10,648 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1127845632, now seen corresponding path program 1 times [2024-10-24 03:02:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657218902] [2024-10-24 03:02:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 03:02:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-24 03:02:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657218902] [2024-10-24 03:02:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657218902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680010147] [2024-10-24 03:02:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:10,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:10,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:10,728 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) [2024-10-24 03:02:10,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 03:02:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 03:02:10,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 03:02:10,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680010147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:10,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:02:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201709319] [2024-10-24 03:02:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:10,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:10,863 INFO L87 Difference]: Start difference. First operand 9551 states and 12169 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2024-10-24 03:02:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:11,645 INFO L93 Difference]: Finished difference Result 12162 states and 15864 transitions. [2024-10-24 03:02:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 [2024-10-24 03:02:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:11,671 INFO L225 Difference]: With dead ends: 12162 [2024-10-24 03:02:11,672 INFO L226 Difference]: Without dead ends: 9000 [2024-10-24 03:02:11,680 INFO L431 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 [2024-10-24 03:02:11,681 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 84 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 544 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 [2024-10-24 03:02:11,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 544 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9000 states. [2024-10-24 03:02:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9000 to 8925. [2024-10-24 03:02:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8925 states, 6984 states have (on average 1.2468499427262314) internal successors, (8708), 7125 states have internal predecessors, (8708), 1009 states have call successors, (1009), 783 states have call predecessors, (1009), 930 states have return successors, (1539), 1026 states have call predecessors, (1539), 1006 states have call successors, (1539) [2024-10-24 03:02:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8925 states to 8925 states and 11256 transitions. [2024-10-24 03:02:12,463 INFO L78 Accepts]: Start accepts. Automaton has 8925 states and 11256 transitions. Word has length 124 [2024-10-24 03:02:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:12,464 INFO L471 AbstractCegarLoop]: Abstraction has 8925 states and 11256 transitions. [2024-10-24 03:02:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2024-10-24 03:02:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8925 states and 11256 transitions. [2024-10-24 03:02:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 03:02:12,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:12,473 INFO L215 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] [2024-10-24 03:02:12,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 03:02:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:12,674 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 232930530, now seen corresponding path program 1 times [2024-10-24 03:02:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611669828] [2024-10-24 03:02:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 03:02:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 03:02:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611669828] [2024-10-24 03:02:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611669828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885059439] [2024-10-24 03:02:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:12,742 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) [2024-10-24 03:02:12,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 03:02:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 03:02:12,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 03:02:12,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885059439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 03:02:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591241812] [2024-10-24 03:02:12,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:12,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:02:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:02:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:02:12,868 INFO L87 Difference]: Start difference. First operand 8925 states and 11256 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 03:02:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:13,717 INFO L93 Difference]: Finished difference Result 11343 states and 14518 transitions. [2024-10-24 03:02:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:02:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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 [2024-10-24 03:02:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:13,740 INFO L225 Difference]: With dead ends: 11343 [2024-10-24 03:02:13,740 INFO L226 Difference]: Without dead ends: 7774 [2024-10-24 03:02:13,749 INFO L431 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 [2024-10-24 03:02:13,749 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 294 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 357 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:13,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 357 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:02:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2024-10-24 03:02:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7732. [2024-10-24 03:02:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 6027 states have (on average 1.2208395553343288) internal successors, (7358), 6134 states have internal predecessors, (7358), 891 states have call successors, (891), 693 states have call predecessors, (891), 812 states have return successors, (1278), 910 states have call predecessors, (1278), 888 states have call successors, (1278) [2024-10-24 03:02:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9527 transitions. [2024-10-24 03:02:14,495 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9527 transitions. Word has length 125 [2024-10-24 03:02:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 7732 states and 9527 transitions. [2024-10-24 03:02:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 03:02:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9527 transitions. [2024-10-24 03:02:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 03:02:14,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:14,500 INFO L215 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] [2024-10-24 03:02:14,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 03:02:14,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 03:02:14,701 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:14,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1386044384, now seen corresponding path program 1 times [2024-10-24 03:02:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818434149] [2024-10-24 03:02:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 03:02:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 03:02:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818434149] [2024-10-24 03:02:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818434149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660595204] [2024-10-24 03:02:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:14,775 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) [2024-10-24 03:02:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 03:02:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 03:02:14,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 03:02:14,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660595204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 03:02:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307656972] [2024-10-24 03:02:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:14,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:02:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:02:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:02:14,893 INFO L87 Difference]: Start difference. First operand 7732 states and 9527 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 03:02:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:15,683 INFO L93 Difference]: Finished difference Result 10427 states and 12997 transitions. [2024-10-24 03:02:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:02:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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 [2024-10-24 03:02:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:15,704 INFO L225 Difference]: With dead ends: 10427 [2024-10-24 03:02:15,704 INFO L226 Difference]: Without dead ends: 6030 [2024-10-24 03:02:15,713 INFO L431 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 [2024-10-24 03:02:15,714 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 321 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:15,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 351 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:02:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2024-10-24 03:02:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 5200. [2024-10-24 03:02:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4004 states have (on average 1.1848151848151849) internal successors, (4744), 4077 states have internal predecessors, (4744), 605 states have call successors, (605), 484 states have call predecessors, (605), 589 states have return successors, (827), 642 states have call predecessors, (827), 602 states have call successors, (827) [2024-10-24 03:02:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6176 transitions. [2024-10-24 03:02:16,288 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6176 transitions. Word has length 125 [2024-10-24 03:02:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:16,288 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 6176 transitions. [2024-10-24 03:02:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 03:02:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6176 transitions. [2024-10-24 03:02:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 03:02:16,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:16,295 INFO L215 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] [2024-10-24 03:02:16,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 03:02:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 03:02:16,496 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2025413922, now seen corresponding path program 1 times [2024-10-24 03:02:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416125912] [2024-10-24 03:02:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 03:02:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 03:02:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416125912] [2024-10-24 03:02:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416125912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928299970] [2024-10-24 03:02:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:16,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:16,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:16,599 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) [2024-10-24 03:02:16,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 03:02:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 03:02:16,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 03:02:16,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928299970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-24 03:02:16,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052182626] [2024-10-24 03:02:16,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:02:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:02:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:16,684 INFO L87 Difference]: Start difference. First operand 5200 states and 6176 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) [2024-10-24 03:02:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:17,229 INFO L93 Difference]: Finished difference Result 6381 states and 7607 transitions. [2024-10-24 03:02:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:02:17,230 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 [2024-10-24 03:02:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:17,243 INFO L225 Difference]: With dead ends: 6381 [2024-10-24 03:02:17,243 INFO L226 Difference]: Without dead ends: 3986 [2024-10-24 03:02:17,246 INFO L431 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 [2024-10-24 03:02:17,247 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:17,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-10-24 03:02:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3986. [2024-10-24 03:02:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3029 states have (on average 1.1838890723010895) internal successors, (3586), 3090 states have internal predecessors, (3586), 472 states have call successors, (472), 388 states have call predecessors, (472), 483 states have return successors, (630), 510 states have call predecessors, (630), 469 states have call successors, (630) [2024-10-24 03:02:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 4688 transitions. [2024-10-24 03:02:17,716 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 4688 transitions. Word has length 125 [2024-10-24 03:02:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:17,716 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 4688 transitions. [2024-10-24 03:02:17,717 INFO L472 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) [2024-10-24 03:02:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 4688 transitions. [2024-10-24 03:02:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 03:02:17,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:17,719 INFO L215 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] [2024-10-24 03:02:17,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 03:02:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 03:02:17,919 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:17,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1372525982, now seen corresponding path program 1 times [2024-10-24 03:02:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574098374] [2024-10-24 03:02:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 03:02:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-24 03:02:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574098374] [2024-10-24 03:02:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574098374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373431864] [2024-10-24 03:02:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:17,995 INFO L87 Difference]: Start difference. First operand 3986 states and 4688 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) [2024-10-24 03:02:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:18,855 INFO L93 Difference]: Finished difference Result 4145 states and 4864 transitions. [2024-10-24 03:02:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:02:18,855 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 [2024-10-24 03:02:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:18,869 INFO L225 Difference]: With dead ends: 4145 [2024-10-24 03:02:18,870 INFO L226 Difference]: Without dead ends: 4142 [2024-10-24 03:02:18,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:02:18,871 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 540 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2024-10-24 03:02:18,871 INFO L433 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] [2024-10-24 03:02:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2024-10-24 03:02:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4111. [2024-10-24 03:02:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 3129 states have (on average 1.1808884627676575) internal successors, (3695), 3190 states have internal predecessors, (3695), 486 states have call successors, (486), 398 states have call predecessors, (486), 494 states have return successors, (646), 525 states have call predecessors, (646), 484 states have call successors, (646) [2024-10-24 03:02:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 4827 transitions. [2024-10-24 03:02:19,397 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 4827 transitions. Word has length 125 [2024-10-24 03:02:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:19,398 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 4827 transitions. [2024-10-24 03:02:19,398 INFO L472 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) [2024-10-24 03:02:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 4827 transitions. [2024-10-24 03:02:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 03:02:19,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:19,400 INFO L215 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] [2024-10-24 03:02:19,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 03:02:19,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:19,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1601398172, now seen corresponding path program 1 times [2024-10-24 03:02:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498513319] [2024-10-24 03:02:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 03:02:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 03:02:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 03:02:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 03:02:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 03:02:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-24 03:02:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498513319] [2024-10-24 03:02:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498513319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393284253] [2024-10-24 03:02:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:19,519 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) [2024-10-24 03:02:19,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 03:02:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:19,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 03:02:19,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 03:02:19,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393284253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-24 03:02:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929212426] [2024-10-24 03:02:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:19,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:19,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:02:19,626 INFO L87 Difference]: Start difference. First operand 4111 states and 4827 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) [2024-10-24 03:02:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:19,941 INFO L93 Difference]: Finished difference Result 5702 states and 6735 transitions. [2024-10-24 03:02:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:02:19,941 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 [2024-10-24 03:02:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:19,951 INFO L225 Difference]: With dead ends: 5702 [2024-10-24 03:02:19,951 INFO L226 Difference]: Without dead ends: 2542 [2024-10-24 03:02:19,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:02:19,955 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:19,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1163 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-24 03:02:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2024-10-24 03:02:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2006 states have (on average 1.1674975074775673) internal successors, (2342), 2030 states have internal predecessors, (2342), 275 states have call successors, (275), 212 states have call predecessors, (275), 259 states have return successors, (353), 300 states have call predecessors, (353), 273 states have call successors, (353) [2024-10-24 03:02:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 2970 transitions. [2024-10-24 03:02:20,233 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 2970 transitions. Word has length 131 [2024-10-24 03:02:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:20,233 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 2970 transitions. [2024-10-24 03:02:20,233 INFO L472 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) [2024-10-24 03:02:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 2970 transitions. [2024-10-24 03:02:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 03:02:20,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:20,235 INFO L215 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] [2024-10-24 03:02:20,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 03:02:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:20,436 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -523809464, now seen corresponding path program 1 times [2024-10-24 03:02:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798570800] [2024-10-24 03:02:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 03:02:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 03:02:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:02:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 03:02:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 03:02:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 03:02:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-24 03:02:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798570800] [2024-10-24 03:02:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798570800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:20,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059658126] [2024-10-24 03:02:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:20,507 INFO L87 Difference]: Start difference. First operand 2542 states and 2970 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) [2024-10-24 03:02:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:20,950 INFO L93 Difference]: Finished difference Result 2590 states and 3020 transitions. [2024-10-24 03:02:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:02:20,951 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 [2024-10-24 03:02:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:20,964 INFO L225 Difference]: With dead ends: 2590 [2024-10-24 03:02:20,964 INFO L226 Difference]: Without dead ends: 2250 [2024-10-24 03:02:20,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:02:20,965 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 368 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:20,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 407 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:02:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-10-24 03:02:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2205. [2024-10-24 03:02:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1753 states have (on average 1.1694238448374215) internal successors, (2050), 1774 states have internal predecessors, (2050), 234 states have call successors, (234), 177 states have call predecessors, (234), 216 states have return successors, (298), 254 states have call predecessors, (298), 232 states have call successors, (298) [2024-10-24 03:02:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2582 transitions. [2024-10-24 03:02:21,237 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2582 transitions. Word has length 133 [2024-10-24 03:02:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:21,237 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 2582 transitions. [2024-10-24 03:02:21,238 INFO L472 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) [2024-10-24 03:02:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2582 transitions. [2024-10-24 03:02:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 03:02:21,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:21,239 INFO L215 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] [2024-10-24 03:02:21,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 03:02:21,240 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1337113526, now seen corresponding path program 1 times [2024-10-24 03:02:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887875048] [2024-10-24 03:02:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 03:02:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 03:02:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 03:02:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 03:02:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 03:02:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 03:02:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-24 03:02:21,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:21,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887875048] [2024-10-24 03:02:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887875048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:21,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:02:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132751510] [2024-10-24 03:02:21,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:02:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:02:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:02:21,295 INFO L87 Difference]: Start difference. First operand 2205 states and 2582 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) [2024-10-24 03:02:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:21,710 INFO L93 Difference]: Finished difference Result 2761 states and 3218 transitions. [2024-10-24 03:02:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:02:21,711 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 [2024-10-24 03:02:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:21,720 INFO L225 Difference]: With dead ends: 2761 [2024-10-24 03:02:21,720 INFO L226 Difference]: Without dead ends: 2232 [2024-10-24 03:02:21,721 INFO L431 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 [2024-10-24 03:02:21,722 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 184 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:21,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 441 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:02:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2024-10-24 03:02:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2207. [2024-10-24 03:02:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1755 states have (on average 1.1692307692307693) internal successors, (2052), 1776 states have internal predecessors, (2052), 234 states have call successors, (234), 177 states have call predecessors, (234), 216 states have return successors, (298), 254 states have call predecessors, (298), 232 states have call successors, (298) [2024-10-24 03:02:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2584 transitions. [2024-10-24 03:02:21,960 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2584 transitions. Word has length 129 [2024-10-24 03:02:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 2584 transitions. [2024-10-24 03:02:21,961 INFO L472 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) [2024-10-24 03:02:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2584 transitions. [2024-10-24 03:02:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 03:02:21,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:21,963 INFO L215 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] [2024-10-24 03:02:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 03:02:21,963 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1566691016, now seen corresponding path program 1 times [2024-10-24 03:02:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487077098] [2024-10-24 03:02:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:02:21,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 03:02:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:02:22,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 03:02:22,024 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 03:02:22,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-24 03:02:22,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-24 03:02:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 03:02:22,030 INFO L407 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] [2024-10-24 03:02:22,126 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 03:02:22,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:02:22 BoogieIcfgContainer [2024-10-24 03:02:22,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 03:02:22,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 03:02:22,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 03:02:22,129 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 03:02:22,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:01:34" (3/4) ... [2024-10-24 03:02:22,130 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 03:02:22,215 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 03:02:22,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 03:02:22,216 INFO L158 Benchmark]: Toolchain (without parser) took 48641.19ms. Allocated memory was 176.2MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 106.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 951.7MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,216 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:02:22,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.68ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 147.0MB in the end (delta: -40.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 176.2MB. Free memory was 147.0MB in the beginning and 144.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,217 INFO L158 Benchmark]: Boogie Preprocessor took 72.95ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 140.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,217 INFO L158 Benchmark]: RCFGBuilder took 591.63ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 105.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,217 INFO L158 Benchmark]: TraceAbstraction took 47421.35ms. Allocated memory was 176.2MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 104.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 930.1MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,218 INFO L158 Benchmark]: Witness Printer took 86.80ms. Allocated memory is still 3.3GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 03:02:22,220 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.19ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.68ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 147.0MB in the end (delta: -40.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 176.2MB. Free memory was 147.0MB in the beginning and 144.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.95ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 140.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 591.63ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 105.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 47421.35ms. Allocated memory was 176.2MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 104.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 930.1MB. Max. memory is 16.1GB. * Witness Printer took 86.80ms. Allocated memory is still 3.3GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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, 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, 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, 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, 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, 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, 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, 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, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\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, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL 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 transmit1() [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, 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, 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, token=0] [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 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, 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, 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 master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL 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, 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, 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 transmit1() [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, 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, 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, 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, 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: 47.3s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16105 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15712 mSDsluCounter, 20238 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13811 mSDsCounter, 3737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16332 IncrementalHoareTripleChecker+Invalid, 20069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3737 mSolverCounterUnsat, 6427 mSDtfsCounter, 16332 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2359 GetRequests, 1980 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9551occurred in iteration=24, InterpolantAutomatonStates: 344, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 6131 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4124 NumberOfCodeBlocks, 4124 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4018 ConstructedInterpolants, 0 QuantifiedInterpolants, 7118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4339 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 44 InterpolantComputations, 31 PerfectInterpolantSequences, 1489/1567 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! [2024-10-24 03:02:22,245 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE