./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.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.15.cil.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 dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:13:41,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:13:41,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:13:41,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:13:41,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:13:41,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:13:41,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:13:41,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:13:41,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:13:41,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:13:41,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:13:41,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:13:41,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:13:41,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:13:41,783 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:13:41,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:13:41,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:13:41,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:13:41,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:13:41,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:13:41,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:13:41,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:13:41,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:13:41,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:13:41,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:13:41,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:13:41,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:13:41,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:13:41,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:13:41,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:13:41,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:13:41,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:13:41,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:13:41,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:13:41,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:13:41,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:13:41,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:13:41,791 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 -> dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a [2024-10-14 05:13:41,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:13:42,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:13:42,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:13:42,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:13:42,009 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:13:42,010 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.15.cil.c [2024-10-14 05:13:43,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:13:43,432 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:13:43,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c [2024-10-14 05:13:43,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba642dfe3/9b88e964838045eeb18b3ca058681f13/FLAG15f9b3757 [2024-10-14 05:13:43,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba642dfe3/9b88e964838045eeb18b3ca058681f13 [2024-10-14 05:13:43,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:13:43,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:13:43,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:13:43,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:13:43,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:13:43,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:43,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b23c4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43, skipping insertion in model container [2024-10-14 05:13:43,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:43,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:13:43,679 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.15.cil.c[914,927] [2024-10-14 05:13:43,715 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.15.cil.c[7115,7128] [2024-10-14 05:13:43,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:13:43,846 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:13:43,856 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.15.cil.c[914,927] [2024-10-14 05:13:43,868 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.15.cil.c[7115,7128] [2024-10-14 05:13:43,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:13:43,939 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:13:43,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43 WrapperNode [2024-10-14 05:13:43,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:13:43,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:13:43,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:13:43,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:13:43,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:43,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,025 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1132 [2024-10-14 05:13:44,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:13:44,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:13:44,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:13:44,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:13:44,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,060 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-14 05:13:44,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:13:44,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:13:44,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:13:44,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:13:44,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (1/1) ... [2024-10-14 05:13:44,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:13:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:44,140 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-14 05:13:44,142 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-14 05:13:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:13:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:13:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:13:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:13:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:13:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:13:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:13:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:13:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:13:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:13:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:13:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:13:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:13:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:13:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:13:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:13:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:13:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:13:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:13:44,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:13:44,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:13:45,179 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-14 05:13:45,179 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:13:45,256 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:13:45,257 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-14 05:13:45,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:45 BoogieIcfgContainer [2024-10-14 05:13:45,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:13:45,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:13:45,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:13:45,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:13:45,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:13:43" (1/3) ... [2024-10-14 05:13:45,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba54910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:45, skipping insertion in model container [2024-10-14 05:13:45,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:43" (2/3) ... [2024-10-14 05:13:45,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba54910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:45, skipping insertion in model container [2024-10-14 05:13:45,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:45" (3/3) ... [2024-10-14 05:13:45,267 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.15.cil.c [2024-10-14 05:13:45,280 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:13:45,280 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:13:45,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:13:45,357 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;@15d9b6ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:13:45,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:13:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 407 states have (on average 1.71990171990172) internal successors, (700), 415 states have internal predecessors, (700), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 05:13:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:45,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:45,375 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-14 05:13:45,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:45,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash 245491008, now seen corresponding path program 1 times [2024-10-14 05:13:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103760402] [2024-10-14 05:13:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:45,828 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-14 05:13:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103760402] [2024-10-14 05:13:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103760402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140442410] [2024-10-14 05:13:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:45,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:45,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:45,859 INFO L87 Difference]: Start difference. First operand has 468 states, 407 states have (on average 1.71990171990172) internal successors, (700), 415 states have internal predecessors, (700), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) 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-14 05:13:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:47,134 INFO L93 Difference]: Finished difference Result 1034 states and 1721 transitions. [2024-10-14 05:13:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:47,137 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-14 05:13:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:47,149 INFO L225 Difference]: With dead ends: 1034 [2024-10-14 05:13:47,149 INFO L226 Difference]: Without dead ends: 587 [2024-10-14 05:13:47,155 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-14 05:13:47,158 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1200 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:47,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1599 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-14 05:13:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 550. [2024-10-14 05:13:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 472 states have (on average 1.5889830508474576) internal successors, (750), 479 states have internal predecessors, (750), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 05:13:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 859 transitions. [2024-10-14 05:13:47,236 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 859 transitions. Word has length 58 [2024-10-14 05:13:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 859 transitions. [2024-10-14 05:13:47,238 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-14 05:13:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 859 transitions. [2024-10-14 05:13:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:47,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:47,242 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-14 05:13:47,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:13:47,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -845671039, now seen corresponding path program 1 times [2024-10-14 05:13:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:47,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943479256] [2024-10-14 05:13:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,455 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-14 05:13:47,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943479256] [2024-10-14 05:13:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943479256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:47,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461822287] [2024-10-14 05:13:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:47,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:47,462 INFO L87 Difference]: Start difference. First operand 550 states and 859 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-14 05:13:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:48,688 INFO L93 Difference]: Finished difference Result 744 states and 1132 transitions. [2024-10-14 05:13:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:48,688 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-14 05:13:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:48,692 INFO L225 Difference]: With dead ends: 744 [2024-10-14 05:13:48,692 INFO L226 Difference]: Without dead ends: 582 [2024-10-14 05:13:48,693 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-14 05:13:48,693 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 971 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:48,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 2301 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-14 05:13:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 554. [2024-10-14 05:13:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 475 states have (on average 1.583157894736842) internal successors, (752), 482 states have internal predecessors, (752), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2024-10-14 05:13:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 862 transitions. [2024-10-14 05:13:48,731 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 862 transitions. Word has length 58 [2024-10-14 05:13:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 862 transitions. [2024-10-14 05:13:48,731 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-14 05:13:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 862 transitions. [2024-10-14 05:13:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:48,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:48,733 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-14 05:13:48,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:13:48,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1205312959, now seen corresponding path program 1 times [2024-10-14 05:13:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629600794] [2024-10-14 05:13:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:48,898 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-14 05:13:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629600794] [2024-10-14 05:13:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629600794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:13:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522489334] [2024-10-14 05:13:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:48,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:13:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:13:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:48,901 INFO L87 Difference]: Start difference. First operand 554 states and 862 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-14 05:13:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:50,604 INFO L93 Difference]: Finished difference Result 1387 states and 2014 transitions. [2024-10-14 05:13:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:13:50,605 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-14 05:13:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:50,610 INFO L225 Difference]: With dead ends: 1387 [2024-10-14 05:13:50,610 INFO L226 Difference]: Without dead ends: 1209 [2024-10-14 05:13:50,611 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-14 05:13:50,612 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 3630 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3646 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:50,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3646 Valid, 2384 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-10-14 05:13:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1092. [2024-10-14 05:13:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 894 states have (on average 1.4798657718120805) internal successors, (1323), 909 states have internal predecessors, (1323), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2024-10-14 05:13:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1559 transitions. [2024-10-14 05:13:50,676 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1559 transitions. Word has length 58 [2024-10-14 05:13:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:50,676 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1559 transitions. [2024-10-14 05:13:50,676 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-14 05:13:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1559 transitions. [2024-10-14 05:13:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:50,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:50,678 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-14 05:13:50,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:13:50,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -826618611, now seen corresponding path program 1 times [2024-10-14 05:13:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743500011] [2024-10-14 05:13:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:50,804 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-14 05:13:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743500011] [2024-10-14 05:13:50,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743500011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:50,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747239532] [2024-10-14 05:13:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:50,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:50,806 INFO L87 Difference]: Start difference. First operand 1092 states and 1559 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-14 05:13:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:51,751 INFO L93 Difference]: Finished difference Result 1902 states and 2631 transitions. [2024-10-14 05:13:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:51,752 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-14 05:13:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:51,757 INFO L225 Difference]: With dead ends: 1902 [2024-10-14 05:13:51,758 INFO L226 Difference]: Without dead ends: 1192 [2024-10-14 05:13:51,759 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-14 05:13:51,759 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 977 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:51,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2299 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:13:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-10-14 05:13:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1108. [2024-10-14 05:13:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 906 states have (on average 1.467991169977925) internal successors, (1330), 921 states have internal predecessors, (1330), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2024-10-14 05:13:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1570 transitions. [2024-10-14 05:13:51,815 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1570 transitions. Word has length 59 [2024-10-14 05:13:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:51,817 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1570 transitions. [2024-10-14 05:13:51,817 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-14 05:13:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1570 transitions. [2024-10-14 05:13:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:51,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:51,820 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-14 05:13:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:13:51,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1096609423, now seen corresponding path program 1 times [2024-10-14 05:13:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875802428] [2024-10-14 05:13:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,947 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-14 05:13:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875802428] [2024-10-14 05:13:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875802428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:51,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759823568] [2024-10-14 05:13:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:51,949 INFO L87 Difference]: Start difference. First operand 1108 states and 1570 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-14 05:13:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:53,016 INFO L93 Difference]: Finished difference Result 2548 states and 3389 transitions. [2024-10-14 05:13:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:13:53,016 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-14 05:13:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:53,023 INFO L225 Difference]: With dead ends: 2548 [2024-10-14 05:13:53,023 INFO L226 Difference]: Without dead ends: 1823 [2024-10-14 05:13:53,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:13:53,025 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1444 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:53,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1892 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:13:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-10-14 05:13:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1521. [2024-10-14 05:13:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1224 states have (on average 1.4248366013071896) internal successors, (1744), 1248 states have internal predecessors, (1744), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2024-10-14 05:13:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2102 transitions. [2024-10-14 05:13:53,121 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2102 transitions. Word has length 59 [2024-10-14 05:13:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:53,121 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2102 transitions. [2024-10-14 05:13:53,121 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-14 05:13:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2102 transitions. [2024-10-14 05:13:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:53,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:53,122 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-14 05:13:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:13:53,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1315464141, now seen corresponding path program 1 times [2024-10-14 05:13:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537644201] [2024-10-14 05:13:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,206 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-14 05:13:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537644201] [2024-10-14 05:13:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537644201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:53,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273491822] [2024-10-14 05:13:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:53,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:53,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:53,209 INFO L87 Difference]: Start difference. First operand 1521 states and 2102 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-14 05:13:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:54,061 INFO L93 Difference]: Finished difference Result 3799 states and 5056 transitions. [2024-10-14 05:13:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:54,061 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-14 05:13:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:54,071 INFO L225 Difference]: With dead ends: 3799 [2024-10-14 05:13:54,071 INFO L226 Difference]: Without dead ends: 2663 [2024-10-14 05:13:54,073 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-14 05:13:54,077 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1780 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:54,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 1271 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-14 05:13:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2559. [2024-10-14 05:13:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 1997 states have (on average 1.3525287931897847) internal successors, (2701), 2043 states have internal predecessors, (2701), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2024-10-14 05:13:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3402 transitions. [2024-10-14 05:13:54,217 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3402 transitions. Word has length 59 [2024-10-14 05:13:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:54,219 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 3402 transitions. [2024-10-14 05:13:54,222 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-14 05:13:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3402 transitions. [2024-10-14 05:13:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:13:54,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:54,223 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-14 05:13:54,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:13:54,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:54,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1487855542, now seen corresponding path program 1 times [2024-10-14 05:13:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:54,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760443705] [2024-10-14 05:13:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:54,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,279 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-14 05:13:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760443705] [2024-10-14 05:13:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760443705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760714487] [2024-10-14 05:13:54,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:54,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:54,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:54,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:54,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:54,281 INFO L87 Difference]: Start difference. First operand 2559 states and 3402 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-14 05:13:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:55,147 INFO L93 Difference]: Finished difference Result 5737 states and 7460 transitions. [2024-10-14 05:13:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:55,147 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-14 05:13:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:55,162 INFO L225 Difference]: With dead ends: 5737 [2024-10-14 05:13:55,162 INFO L226 Difference]: Without dead ends: 3570 [2024-10-14 05:13:55,166 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-14 05:13:55,168 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1188 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:55,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1270 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2024-10-14 05:13:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3324. [2024-10-14 05:13:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3324 states, 2574 states have (on average 1.3302253302253302) internal successors, (3424), 2627 states have internal predecessors, (3424), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2024-10-14 05:13:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4335 transitions. [2024-10-14 05:13:55,412 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4335 transitions. Word has length 60 [2024-10-14 05:13:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:55,412 INFO L471 AbstractCegarLoop]: Abstraction has 3324 states and 4335 transitions. [2024-10-14 05:13:55,413 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-14 05:13:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4335 transitions. [2024-10-14 05:13:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:13:55,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:55,414 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-14 05:13:55,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:13:55,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:55,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash 408858921, now seen corresponding path program 1 times [2024-10-14 05:13:55,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:55,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534626243] [2024-10-14 05:13:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:55,505 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-14 05:13:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534626243] [2024-10-14 05:13:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534626243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812294414] [2024-10-14 05:13:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:55,508 INFO L87 Difference]: Start difference. First operand 3324 states and 4335 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-14 05:13:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:56,402 INFO L93 Difference]: Finished difference Result 7017 states and 8991 transitions. [2024-10-14 05:13:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:56,402 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-14 05:13:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:56,417 INFO L225 Difference]: With dead ends: 7017 [2024-10-14 05:13:56,417 INFO L226 Difference]: Without dead ends: 4081 [2024-10-14 05:13:56,422 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-14 05:13:56,423 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1391 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:56,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 1328 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2024-10-14 05:13:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 3837. [2024-10-14 05:13:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2971 states have (on average 1.319757657354426) internal successors, (3921), 3030 states have internal predecessors, (3921), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2024-10-14 05:13:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4965 transitions. [2024-10-14 05:13:56,648 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4965 transitions. Word has length 66 [2024-10-14 05:13:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 4965 transitions. [2024-10-14 05:13:56,649 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-14 05:13:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4965 transitions. [2024-10-14 05:13:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:13:56,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:56,651 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-14 05:13:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:13:56,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -727308181, now seen corresponding path program 1 times [2024-10-14 05:13:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763030091] [2024-10-14 05:13:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,737 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-14 05:13:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:56,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763030091] [2024-10-14 05:13:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763030091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:56,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:56,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416998694] [2024-10-14 05:13:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:56,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:56,739 INFO L87 Difference]: Start difference. First operand 3837 states and 4965 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-14 05:13:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:57,665 INFO L93 Difference]: Finished difference Result 4828 states and 6171 transitions. [2024-10-14 05:13:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:13:57,666 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-14 05:13:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:57,683 INFO L225 Difference]: With dead ends: 4828 [2024-10-14 05:13:57,684 INFO L226 Difference]: Without dead ends: 4825 [2024-10-14 05:13:57,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:57,686 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 2083 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:57,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 1302 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2024-10-14 05:13:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4526. [2024-10-14 05:13:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 3481 states have (on average 1.3068083883941397) internal successors, (4549), 3547 states have internal predecessors, (4549), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2024-10-14 05:13:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 5804 transitions. [2024-10-14 05:13:57,979 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 5804 transitions. Word has length 67 [2024-10-14 05:13:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:57,980 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 5804 transitions. [2024-10-14 05:13:57,980 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-14 05:13:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 5804 transitions. [2024-10-14 05:13:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:13:57,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:57,982 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-14 05:13:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:13:57,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1073253965, now seen corresponding path program 1 times [2024-10-14 05:13:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459626465] [2024-10-14 05:13:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,104 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-14 05:13:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:58,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459626465] [2024-10-14 05:13:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459626465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:58,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906283402] [2024-10-14 05:13:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:58,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:58,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:58,106 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-14 05:13:58,107 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-14 05:13:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:13:58,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:58,416 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-14 05:13:58,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:13:58,513 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-14 05:13:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906283402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:13:58,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:13:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:13:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96166503] [2024-10-14 05:13:58,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:13:58,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:13:58,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:13:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:58,515 INFO L87 Difference]: Start difference. First operand 4526 states and 5804 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-14 05:14:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:00,434 INFO L93 Difference]: Finished difference Result 8678 states and 10927 transitions. [2024-10-14 05:14:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 05:14:00,435 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-14 05:14:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:00,472 INFO L225 Difference]: With dead ends: 8678 [2024-10-14 05:14:00,472 INFO L226 Difference]: Without dead ends: 8675 [2024-10-14 05:14:00,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-14 05:14:00,475 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 2445 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2512 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:00,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2512 Valid, 2214 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:14:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8675 states. [2024-10-14 05:14:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8675 to 7837. [2024-10-14 05:14:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7837 states, 6002 states have (on average 1.2877374208597134) internal successors, (7729), 6119 states have internal predecessors, (7729), 895 states have call successors, (895), 754 states have call predecessors, (895), 938 states have return successors, (1295), 968 states have call predecessors, (1295), 892 states have call successors, (1295) [2024-10-14 05:14:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7837 states to 7837 states and 9919 transitions. [2024-10-14 05:14:01,044 INFO L78 Accepts]: Start accepts. Automaton has 7837 states and 9919 transitions. Word has length 68 [2024-10-14 05:14:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:01,045 INFO L471 AbstractCegarLoop]: Abstraction has 7837 states and 9919 transitions. [2024-10-14 05:14:01,045 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-14 05:14:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7837 states and 9919 transitions. [2024-10-14 05:14:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:14:01,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:01,047 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-14 05:14:01,061 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-14 05:14:01,248 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,SelfDestructingSolverStorable9 [2024-10-14 05:14:01,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 998274283, now seen corresponding path program 2 times [2024-10-14 05:14:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992332041] [2024-10-14 05:14:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:01,303 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-14 05:14:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:01,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992332041] [2024-10-14 05:14:01,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992332041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:14:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871282671] [2024-10-14 05:14:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:01,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:14:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:14:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:14:01,310 INFO L87 Difference]: Start difference. First operand 7837 states and 9919 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-14 05:14:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:02,127 INFO L93 Difference]: Finished difference Result 10627 states and 13426 transitions. [2024-10-14 05:14:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:14:02,128 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-14 05:14:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:02,148 INFO L225 Difference]: With dead ends: 10627 [2024-10-14 05:14:02,148 INFO L226 Difference]: Without dead ends: 4415 [2024-10-14 05:14:02,160 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-14 05:14:02,160 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1649 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:02,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1057 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:14:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2024-10-14 05:14:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3420. [2024-10-14 05:14:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 2653 states have (on average 1.2977761025254428) internal successors, (3443), 2692 states have internal predecessors, (3443), 394 states have call successors, (394), 318 states have call predecessors, (394), 371 states have return successors, (519), 414 states have call predecessors, (519), 391 states have call successors, (519) [2024-10-14 05:14:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4356 transitions. [2024-10-14 05:14:02,414 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4356 transitions. Word has length 71 [2024-10-14 05:14:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 3420 states and 4356 transitions. [2024-10-14 05:14:02,415 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-14 05:14:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4356 transitions. [2024-10-14 05:14:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:14:02,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:02,416 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-14 05:14:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:14:02,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash -905337230, now seen corresponding path program 1 times [2024-10-14 05:14:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137734709] [2024-10-14 05:14:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:14:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,513 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-14 05:14:02,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:02,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137734709] [2024-10-14 05:14:02,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137734709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:02,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:14:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842463879] [2024-10-14 05:14:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:14:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:14:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:14:02,514 INFO L87 Difference]: Start difference. First operand 3420 states and 4356 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-14 05:14:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:04,145 INFO L93 Difference]: Finished difference Result 9498 states and 11849 transitions. [2024-10-14 05:14:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:14:04,145 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-14 05:14:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:04,161 INFO L225 Difference]: With dead ends: 9498 [2024-10-14 05:14:04,161 INFO L226 Difference]: Without dead ends: 5482 [2024-10-14 05:14:04,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:14:04,168 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1086 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:04,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1987 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:14:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-14 05:14:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5218. [2024-10-14 05:14:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 3978 states have (on average 1.256913021618904) internal successors, (5000), 4060 states have internal predecessors, (5000), 610 states have call successors, (610), 504 states have call predecessors, (610), 628 states have return successors, (903), 658 states have call predecessors, (903), 607 states have call successors, (903) [2024-10-14 05:14:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6513 transitions. [2024-10-14 05:14:04,532 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6513 transitions. Word has length 76 [2024-10-14 05:14:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:04,533 INFO L471 AbstractCegarLoop]: Abstraction has 5218 states and 6513 transitions. [2024-10-14 05:14:04,533 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-14 05:14:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6513 transitions. [2024-10-14 05:14:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:14:04,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:04,535 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-14 05:14:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:14:04,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:04,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1890530074, now seen corresponding path program 1 times [2024-10-14 05:14:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743608504] [2024-10-14 05:14:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:14:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:04,635 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-14 05:14:04,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:04,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743608504] [2024-10-14 05:14:04,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743608504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:04,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:04,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:14:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892305147] [2024-10-14 05:14:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:04,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:14:04,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:14:04,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:04,637 INFO L87 Difference]: Start difference. First operand 5218 states and 6513 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-14 05:14:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:05,992 INFO L93 Difference]: Finished difference Result 8573 states and 10579 transitions. [2024-10-14 05:14:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:14:05,992 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-14 05:14:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:06,005 INFO L225 Difference]: With dead ends: 8573 [2024-10-14 05:14:06,006 INFO L226 Difference]: Without dead ends: 4407 [2024-10-14 05:14:06,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-14 05:14:06,013 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 2359 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:06,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 1971 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:14:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2024-10-14 05:14:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 3993. [2024-10-14 05:14:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3039 states have (on average 1.2458045409674234) internal successors, (3786), 3104 states have internal predecessors, (3786), 467 states have call successors, (467), 379 states have call predecessors, (467), 485 states have return successors, (645), 514 states have call predecessors, (645), 464 states have call successors, (645) [2024-10-14 05:14:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 4898 transitions. [2024-10-14 05:14:06,315 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 4898 transitions. Word has length 86 [2024-10-14 05:14:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:06,316 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 4898 transitions. [2024-10-14 05:14:06,316 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-14 05:14:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 4898 transitions. [2024-10-14 05:14:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:14:06,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:06,320 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-14 05:14:06,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:14:06,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash 582729720, now seen corresponding path program 1 times [2024-10-14 05:14:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417710278] [2024-10-14 05:14:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:14:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:14:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:14:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:14:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:14:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:14:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:14:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,454 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-14 05:14:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417710278] [2024-10-14 05:14:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417710278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:14:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367609754] [2024-10-14 05:14:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:14:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:14:06,456 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-14 05:14:06,481 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-14 05:14:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:14:06,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:14:06,619 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-14 05:14:06,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:14:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367609754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:06,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:14:06,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:14:06,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848905262] [2024-10-14 05:14:06,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:06,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:14:06,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:06,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:14:06,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:14:06,621 INFO L87 Difference]: Start difference. First operand 3993 states and 4898 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-14 05:14:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:06,842 INFO L93 Difference]: Finished difference Result 5883 states and 7152 transitions. [2024-10-14 05:14:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:14:06,843 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-14 05:14:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:06,852 INFO L225 Difference]: With dead ends: 5883 [2024-10-14 05:14:06,852 INFO L226 Difference]: Without dead ends: 2282 [2024-10-14 05:14:06,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:14:06,859 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 0 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:06,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3368 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:14:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2024-10-14 05:14:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2267. [2024-10-14 05:14:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 1813 states have (on average 1.272476558190844) internal successors, (2307), 1832 states have internal predecessors, (2307), 229 states have call successors, (229), 173 states have call predecessors, (229), 223 states have return successors, (309), 262 states have call predecessors, (309), 226 states have call successors, (309) [2024-10-14 05:14:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2845 transitions. [2024-10-14 05:14:06,996 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2845 transitions. Word has length 131 [2024-10-14 05:14:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:06,996 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 2845 transitions. [2024-10-14 05:14:06,997 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-14 05:14:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2845 transitions. [2024-10-14 05:14:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 05:14:06,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:06,999 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-14 05:14:07,012 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-14 05:14:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 05:14:07,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -232080284, now seen corresponding path program 1 times [2024-10-14 05:14:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867845927] [2024-10-14 05:14:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:14:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 05:14:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 05:14:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:14:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 05:14:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:14:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:14:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,279 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-14 05:14:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867845927] [2024-10-14 05:14:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867845927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:07,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:14:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461891768] [2024-10-14 05:14:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:07,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:14:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:14:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:14:07,280 INFO L87 Difference]: Start difference. First operand 2267 states and 2845 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-14 05:14:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:07,943 INFO L93 Difference]: Finished difference Result 2321 states and 2901 transitions. [2024-10-14 05:14:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:07,944 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-14 05:14:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:07,950 INFO L225 Difference]: With dead ends: 2321 [2024-10-14 05:14:07,951 INFO L226 Difference]: Without dead ends: 1850 [2024-10-14 05:14:07,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:14:07,952 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 757 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:07,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1511 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:14:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-10-14 05:14:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1799. [2024-10-14 05:14:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1463 states have (on average 1.300751879699248) internal successors, (1903), 1478 states have internal predecessors, (1903), 172 states have call successors, (172), 124 states have call predecessors, (172), 162 states have return successors, (231), 197 states have call predecessors, (231), 169 states have call successors, (231) [2024-10-14 05:14:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2306 transitions. [2024-10-14 05:14:08,149 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2306 transitions. Word has length 133 [2024-10-14 05:14:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2306 transitions. [2024-10-14 05:14:08,149 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-14 05:14:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2306 transitions. [2024-10-14 05:14:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:14:08,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:08,152 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:14:08,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:14:08,152 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2061799994, now seen corresponding path program 1 times [2024-10-14 05:14:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077504897] [2024-10-14 05:14:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:14:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:14:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 05:14:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 05:14:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:14:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:14:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 05:14:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 05:14:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077504897] [2024-10-14 05:14:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077504897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486012231] [2024-10-14 05:14:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:08,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:08,256 INFO L87 Difference]: Start difference. First operand 1799 states and 2306 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:14:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:09,106 INFO L93 Difference]: Finished difference Result 2966 states and 3710 transitions. [2024-10-14 05:14:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:14:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-14 05:14:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:09,113 INFO L225 Difference]: With dead ends: 2966 [2024-10-14 05:14:09,113 INFO L226 Difference]: Without dead ends: 1707 [2024-10-14 05:14:09,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:09,115 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1006 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:09,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1644 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:14:09,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-10-14 05:14:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1568. [2024-10-14 05:14:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1283 states have (on average 1.3211223694466094) internal successors, (1695), 1298 states have internal predecessors, (1695), 147 states have call successors, (147), 103 states have call predecessors, (147), 136 states have return successors, (193), 167 states have call predecessors, (193), 144 states have call successors, (193) [2024-10-14 05:14:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2035 transitions. [2024-10-14 05:14:09,220 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2035 transitions. Word has length 145 [2024-10-14 05:14:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2035 transitions. [2024-10-14 05:14:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:14:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2035 transitions. [2024-10-14 05:14:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 05:14:09,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:09,224 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:14:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:14:09,224 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:09,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1631420159, now seen corresponding path program 1 times [2024-10-14 05:14:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576728260] [2024-10-14 05:14:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:14:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:14:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 05:14:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 05:14:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:14:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:14:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 05:14:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-14 05:14:09,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576728260] [2024-10-14 05:14:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576728260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:14:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781815176] [2024-10-14 05:14:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:14:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:14:09,465 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-14 05:14:09,467 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-14 05:14:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 05:14:09,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:14:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:14:09,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:14:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781815176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:14:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-10-14 05:14:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261243766] [2024-10-14 05:14:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:14:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:14:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:09,698 INFO L87 Difference]: Start difference. First operand 1568 states and 2035 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 05:14:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:10,358 INFO L93 Difference]: Finished difference Result 3678 states and 4627 transitions. [2024-10-14 05:14:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:14:10,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2024-10-14 05:14:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:10,366 INFO L225 Difference]: With dead ends: 3678 [2024-10-14 05:14:10,366 INFO L226 Difference]: Without dead ends: 2396 [2024-10-14 05:14:10,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:14:10,368 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 377 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:10,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1001 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:14:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-14 05:14:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2357. [2024-10-14 05:14:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1929 states have (on average 1.268532918610679) internal successors, (2447), 1948 states have internal predecessors, (2447), 217 states have call successors, (217), 154 states have call predecessors, (217), 209 states have return successors, (304), 255 states have call predecessors, (304), 214 states have call successors, (304) [2024-10-14 05:14:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 2968 transitions. [2024-10-14 05:14:10,507 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 2968 transitions. Word has length 147 [2024-10-14 05:14:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:10,507 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 2968 transitions. [2024-10-14 05:14:10,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 05:14:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 2968 transitions. [2024-10-14 05:14:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:10,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:10,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:10,522 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-14 05:14:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:14:10,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2123489297, now seen corresponding path program 1 times [2024-10-14 05:14:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005347281] [2024-10-14 05:14:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,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-14 05:14:10,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005347281] [2024-10-14 05:14:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005347281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:10,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:10,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:14:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492600210] [2024-10-14 05:14:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:14:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:14:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:14:10,868 INFO L87 Difference]: Start difference. First operand 2357 states and 2968 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:12,756 INFO L93 Difference]: Finished difference Result 2867 states and 3824 transitions. [2024-10-14 05:14:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-14 05:14:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:12,763 INFO L225 Difference]: With dead ends: 2867 [2024-10-14 05:14:12,763 INFO L226 Difference]: Without dead ends: 2497 [2024-10-14 05:14:12,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:12,764 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1152 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:12,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 884 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:14:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2024-10-14 05:14:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2357. [2024-10-14 05:14:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1929 states have (on average 1.2680145152928979) internal successors, (2446), 1948 states have internal predecessors, (2446), 217 states have call successors, (217), 154 states have call predecessors, (217), 209 states have return successors, (304), 255 states have call predecessors, (304), 214 states have call successors, (304) [2024-10-14 05:14:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 2967 transitions. [2024-10-14 05:14:13,043 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 2967 transitions. Word has length 172 [2024-10-14 05:14:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:13,044 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 2967 transitions. [2024-10-14 05:14:13,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 2967 transitions. [2024-10-14 05:14:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:13,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:13,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:14:13,046 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1662699185, now seen corresponding path program 1 times [2024-10-14 05:14:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:13,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689030125] [2024-10-14 05:14:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,187 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-14 05:14:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689030125] [2024-10-14 05:14:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689030125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:13,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:14:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554315531] [2024-10-14 05:14:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:13,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:14:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:14:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:14:13,189 INFO L87 Difference]: Start difference. First operand 2357 states and 2967 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:15,180 INFO L93 Difference]: Finished difference Result 2859 states and 3807 transitions. [2024-10-14 05:14:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-14 05:14:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:15,188 INFO L225 Difference]: With dead ends: 2859 [2024-10-14 05:14:15,188 INFO L226 Difference]: Without dead ends: 2497 [2024-10-14 05:14:15,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:15,190 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1143 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:15,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 882 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:14:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2024-10-14 05:14:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2357. [2024-10-14 05:14:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1929 states have (on average 1.2674961119751167) internal successors, (2445), 1948 states have internal predecessors, (2445), 217 states have call successors, (217), 154 states have call predecessors, (217), 209 states have return successors, (304), 255 states have call predecessors, (304), 214 states have call successors, (304) [2024-10-14 05:14:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 2966 transitions. [2024-10-14 05:14:15,666 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 2966 transitions. Word has length 172 [2024-10-14 05:14:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:15,667 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 2966 transitions. [2024-10-14 05:14:15,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 2966 transitions. [2024-10-14 05:14:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:15,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:15,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:14:15,671 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -437039245, now seen corresponding path program 1 times [2024-10-14 05:14:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982771860] [2024-10-14 05:14:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,874 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-14 05:14:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982771860] [2024-10-14 05:14:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982771860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:14:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023406946] [2024-10-14 05:14:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:14:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:14:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:14:15,877 INFO L87 Difference]: Start difference. First operand 2357 states and 2966 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-14 05:14:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:18,488 INFO L93 Difference]: Finished difference Result 3368 states and 4662 transitions. [2024-10-14 05:14:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:14:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:18,495 INFO L225 Difference]: With dead ends: 3368 [2024-10-14 05:14:18,495 INFO L226 Difference]: Without dead ends: 3013 [2024-10-14 05:14:18,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:18,497 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1796 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:18,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 1330 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:14:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-10-14 05:14:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2732. [2024-10-14 05:14:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2275 states have (on average 1.3265934065934066) internal successors, (3018), 2295 states have internal predecessors, (3018), 239 states have call successors, (239), 160 states have call predecessors, (239), 216 states have return successors, (329), 277 states have call predecessors, (329), 236 states have call successors, (329) [2024-10-14 05:14:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3586 transitions. [2024-10-14 05:14:18,798 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3586 transitions. Word has length 172 [2024-10-14 05:14:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 2732 states and 3586 transitions. [2024-10-14 05:14:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-14 05:14:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3586 transitions. [2024-10-14 05:14:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:18,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:18,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:14:18,801 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 568066031, now seen corresponding path program 1 times [2024-10-14 05:14:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760600787] [2024-10-14 05:14:18,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,997 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-14 05:14:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760600787] [2024-10-14 05:14:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760600787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608788111] [2024-10-14 05:14:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:18,998 INFO L87 Difference]: Start difference. First operand 2732 states and 3586 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:22,585 INFO L93 Difference]: Finished difference Result 4279 states and 6184 transitions. [2024-10-14 05:14:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:22,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:22,593 INFO L225 Difference]: With dead ends: 4279 [2024-10-14 05:14:22,593 INFO L226 Difference]: Without dead ends: 3549 [2024-10-14 05:14:22,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:22,594 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 1833 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 4264 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 4365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:22,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1863 Valid, 2414 Invalid, 4365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4264 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:14:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2024-10-14 05:14:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3078. [2024-10-14 05:14:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2592 states have (on average 1.3630401234567902) internal successors, (3533), 2613 states have internal predecessors, (3533), 261 states have call successors, (261), 166 states have call predecessors, (261), 223 states have return successors, (353), 300 states have call predecessors, (353), 258 states have call successors, (353) [2024-10-14 05:14:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4147 transitions. [2024-10-14 05:14:22,915 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4147 transitions. Word has length 172 [2024-10-14 05:14:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:22,915 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4147 transitions. [2024-10-14 05:14:22,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4147 transitions. [2024-10-14 05:14:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:22,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:22,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:22,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:14:22,918 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:22,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 953928433, now seen corresponding path program 1 times [2024-10-14 05:14:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124620348] [2024-10-14 05:14:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:23,101 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-14 05:14:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124620348] [2024-10-14 05:14:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124620348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993404812] [2024-10-14 05:14:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:23,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:23,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:23,104 INFO L87 Difference]: Start difference. First operand 3078 states and 4147 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:26,649 INFO L93 Difference]: Finished difference Result 5614 states and 8399 transitions. [2024-10-14 05:14:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:26,663 INFO L225 Difference]: With dead ends: 5614 [2024-10-14 05:14:26,663 INFO L226 Difference]: Without dead ends: 4538 [2024-10-14 05:14:26,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:26,667 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 1831 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 4260 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 4363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:26,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 2412 Invalid, 4363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4260 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:14:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2024-10-14 05:14:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 3771. [2024-10-14 05:14:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3227 states have (on average 1.4143167028199566) internal successors, (4564), 3250 states have internal predecessors, (4564), 305 states have call successors, (305), 178 states have call predecessors, (305), 237 states have return successors, (405), 346 states have call predecessors, (405), 302 states have call successors, (405) [2024-10-14 05:14:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5274 transitions. [2024-10-14 05:14:27,072 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 5274 transitions. Word has length 172 [2024-10-14 05:14:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:27,073 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 5274 transitions. [2024-10-14 05:14:27,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 5274 transitions. [2024-10-14 05:14:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:27,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:27,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:27,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:14:27,076 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 689280943, now seen corresponding path program 1 times [2024-10-14 05:14:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282527391] [2024-10-14 05:14:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:27,250 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-14 05:14:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282527391] [2024-10-14 05:14:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282527391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702343402] [2024-10-14 05:14:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:27,252 INFO L87 Difference]: Start difference. First operand 3771 states and 5274 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:29,089 INFO L93 Difference]: Finished difference Result 6295 states and 9517 transitions. [2024-10-14 05:14:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:29,102 INFO L225 Difference]: With dead ends: 6295 [2024-10-14 05:14:29,102 INFO L226 Difference]: Without dead ends: 4526 [2024-10-14 05:14:29,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:29,106 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1575 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:29,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 1127 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:14:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2024-10-14 05:14:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3771. [2024-10-14 05:14:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3227 states have (on average 1.41276727610784) internal successors, (4559), 3250 states have internal predecessors, (4559), 305 states have call successors, (305), 178 states have call predecessors, (305), 237 states have return successors, (405), 346 states have call predecessors, (405), 302 states have call successors, (405) [2024-10-14 05:14:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5269 transitions. [2024-10-14 05:14:29,503 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 5269 transitions. Word has length 172 [2024-10-14 05:14:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:29,504 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 5269 transitions. [2024-10-14 05:14:29,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 5269 transitions. [2024-10-14 05:14:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:29,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:29,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:14:29,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1674560719, now seen corresponding path program 1 times [2024-10-14 05:14:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660369250] [2024-10-14 05:14:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:29,680 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-14 05:14:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660369250] [2024-10-14 05:14:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660369250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921768987] [2024-10-14 05:14:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:29,681 INFO L87 Difference]: Start difference. First operand 3771 states and 5269 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:31,631 INFO L93 Difference]: Finished difference Result 6289 states and 9491 transitions. [2024-10-14 05:14:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:31,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:31,641 INFO L225 Difference]: With dead ends: 6289 [2024-10-14 05:14:31,641 INFO L226 Difference]: Without dead ends: 4520 [2024-10-14 05:14:31,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:31,643 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1367 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:31,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1348 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:14:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2024-10-14 05:14:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3771. [2024-10-14 05:14:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3227 states have (on average 1.4112178493957235) internal successors, (4554), 3250 states have internal predecessors, (4554), 305 states have call successors, (305), 178 states have call predecessors, (305), 237 states have return successors, (405), 346 states have call predecessors, (405), 302 states have call successors, (405) [2024-10-14 05:14:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5264 transitions. [2024-10-14 05:14:32,014 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 5264 transitions. Word has length 172 [2024-10-14 05:14:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:32,014 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 5264 transitions. [2024-10-14 05:14:32,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 5264 transitions. [2024-10-14 05:14:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:32,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:32,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:14:32,016 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1297227631, now seen corresponding path program 1 times [2024-10-14 05:14:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858091793] [2024-10-14 05:14:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:32,205 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-14 05:14:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858091793] [2024-10-14 05:14:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858091793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:32,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:32,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58005053] [2024-10-14 05:14:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:32,207 INFO L87 Difference]: Start difference. First operand 3771 states and 5264 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:35,529 INFO L93 Difference]: Finished difference Result 8152 states and 12538 transitions. [2024-10-14 05:14:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:35,543 INFO L225 Difference]: With dead ends: 8152 [2024-10-14 05:14:35,543 INFO L226 Difference]: Without dead ends: 6383 [2024-10-14 05:14:35,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:35,547 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1934 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:35,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 1642 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:14:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2024-10-14 05:14:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 5171. [2024-10-14 05:14:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4511 states have (on average 1.4692972733318554) internal successors, (6628), 4538 states have internal predecessors, (6628), 393 states have call successors, (393), 202 states have call predecessors, (393), 265 states have return successors, (515), 438 states have call predecessors, (515), 390 states have call successors, (515) [2024-10-14 05:14:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 7536 transitions. [2024-10-14 05:14:36,036 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 7536 transitions. Word has length 172 [2024-10-14 05:14:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:36,037 INFO L471 AbstractCegarLoop]: Abstraction has 5171 states and 7536 transitions. [2024-10-14 05:14:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 7536 transitions. [2024-10-14 05:14:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:36,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:36,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:36,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:14:36,040 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:36,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1635515181, now seen corresponding path program 1 times [2024-10-14 05:14:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891686330] [2024-10-14 05:14:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:36,227 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-14 05:14:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891686330] [2024-10-14 05:14:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891686330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674513054] [2024-10-14 05:14:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:36,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:36,228 INFO L87 Difference]: Start difference. First operand 5171 states and 7536 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:38,309 INFO L93 Difference]: Finished difference Result 9579 states and 14891 transitions. [2024-10-14 05:14:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:38,324 INFO L225 Difference]: With dead ends: 9579 [2024-10-14 05:14:38,325 INFO L226 Difference]: Without dead ends: 6410 [2024-10-14 05:14:38,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:38,331 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1365 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:38,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1348 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:14:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6410 states. [2024-10-14 05:14:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6410 to 5171. [2024-10-14 05:14:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4511 states have (on average 1.4673021502992685) internal successors, (6619), 4538 states have internal predecessors, (6619), 393 states have call successors, (393), 202 states have call predecessors, (393), 265 states have return successors, (515), 438 states have call predecessors, (515), 390 states have call successors, (515) [2024-10-14 05:14:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 7527 transitions. [2024-10-14 05:14:38,833 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 7527 transitions. Word has length 172 [2024-10-14 05:14:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 5171 states and 7527 transitions. [2024-10-14 05:14:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 7527 transitions. [2024-10-14 05:14:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:38,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:38,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:38,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:14:38,836 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:38,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2062069679, now seen corresponding path program 1 times [2024-10-14 05:14:38,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:38,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328648012] [2024-10-14 05:14:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:39,032 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-14 05:14:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328648012] [2024-10-14 05:14:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328648012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:39,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141050180] [2024-10-14 05:14:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:39,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:39,034 INFO L87 Difference]: Start difference. First operand 5171 states and 7527 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:42,822 INFO L93 Difference]: Finished difference Result 13256 states and 20888 transitions. [2024-10-14 05:14:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:42,842 INFO L225 Difference]: With dead ends: 13256 [2024-10-14 05:14:42,843 INFO L226 Difference]: Without dead ends: 10087 [2024-10-14 05:14:42,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:42,849 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 1809 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:42,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 2412 Invalid, 4244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:14:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10087 states. [2024-10-14 05:14:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10087 to 7981. [2024-10-14 05:14:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7981 states, 7089 states have (on average 1.5188319932289462) internal successors, (10767), 7124 states have internal predecessors, (10767), 569 states have call successors, (569), 250 states have call predecessors, (569), 321 states have return successors, (753), 622 states have call predecessors, (753), 566 states have call successors, (753) [2024-10-14 05:14:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7981 states to 7981 states and 12089 transitions. [2024-10-14 05:14:43,523 INFO L78 Accepts]: Start accepts. Automaton has 7981 states and 12089 transitions. Word has length 172 [2024-10-14 05:14:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 7981 states and 12089 transitions. [2024-10-14 05:14:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7981 states and 12089 transitions. [2024-10-14 05:14:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:43,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:43,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:14:43,527 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:43,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1521640173, now seen corresponding path program 1 times [2024-10-14 05:14:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730931197] [2024-10-14 05:14:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:43,709 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-14 05:14:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730931197] [2024-10-14 05:14:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730931197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368801668] [2024-10-14 05:14:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:43,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:43,711 INFO L87 Difference]: Start difference. First operand 7981 states and 12089 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:47,813 INFO L93 Difference]: Finished difference Result 23480 states and 37720 transitions. [2024-10-14 05:14:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:47,852 INFO L225 Difference]: With dead ends: 23480 [2024-10-14 05:14:47,852 INFO L226 Difference]: Without dead ends: 17501 [2024-10-14 05:14:47,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:47,866 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 1808 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 4128 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:47,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2412 Invalid, 4231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4128 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:14:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17501 states. [2024-10-14 05:14:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17501 to 13614. [2024-10-14 05:14:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13614 states, 12258 states have (on average 1.5566160874530919) internal successors, (19081), 12309 states have internal predecessors, (19081), 921 states have call successors, (921), 346 states have call predecessors, (921), 433 states have return successors, (1283), 990 states have call predecessors, (1283), 918 states have call successors, (1283) [2024-10-14 05:14:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 21285 transitions. [2024-10-14 05:14:49,103 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 21285 transitions. Word has length 172 [2024-10-14 05:14:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:49,103 INFO L471 AbstractCegarLoop]: Abstraction has 13614 states and 21285 transitions. [2024-10-14 05:14:49,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 21285 transitions. [2024-10-14 05:14:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:49,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:49,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:49,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 05:14:49,110 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1365659631, now seen corresponding path program 1 times [2024-10-14 05:14:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059026787] [2024-10-14 05:14:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:49,348 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-14 05:14:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059026787] [2024-10-14 05:14:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059026787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914149092] [2024-10-14 05:14:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:49,349 INFO L87 Difference]: Start difference. First operand 13614 states and 21285 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:54,326 INFO L93 Difference]: Finished difference Result 43927 states and 71574 transitions. [2024-10-14 05:14:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:14:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:54,397 INFO L225 Difference]: With dead ends: 43927 [2024-10-14 05:14:54,397 INFO L226 Difference]: Without dead ends: 32315 [2024-10-14 05:14:54,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:54,419 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 1807 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:54,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 2412 Invalid, 4218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:14:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32315 states. [2024-10-14 05:14:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32315 to 24911. [2024-10-14 05:14:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24911 states, 22627 states have (on average 1.5801918062491713) internal successors, (35755), 22710 states have internal predecessors, (35755), 1625 states have call successors, (1625), 538 states have call predecessors, (1625), 657 states have return successors, (2505), 1726 states have call predecessors, (2505), 1622 states have call successors, (2505) [2024-10-14 05:14:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24911 states to 24911 states and 39885 transitions. [2024-10-14 05:14:56,388 INFO L78 Accepts]: Start accepts. Automaton has 24911 states and 39885 transitions. Word has length 172 [2024-10-14 05:14:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 24911 states and 39885 transitions. [2024-10-14 05:14:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:14:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24911 states and 39885 transitions. [2024-10-14 05:14:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:14:56,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:56,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 05:14:56,397 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1776269997, now seen corresponding path program 1 times [2024-10-14 05:14:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648717585] [2024-10-14 05:14:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:14:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:14:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:14:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:14:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:56,641 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-14 05:14:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648717585] [2024-10-14 05:14:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648717585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966439921] [2024-10-14 05:14:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:56,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:56,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:56,643 INFO L87 Difference]: Start difference. First operand 24911 states and 39885 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:15:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:00,133 INFO L93 Difference]: Finished difference Result 55715 states and 91802 transitions. [2024-10-14 05:15:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:15:00,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:15:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:00,228 INFO L225 Difference]: With dead ends: 55715 [2024-10-14 05:15:00,229 INFO L226 Difference]: Without dead ends: 32806 [2024-10-14 05:15:00,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:15:00,269 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1577 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:00,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 1127 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:15:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32806 states. [2024-10-14 05:15:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32806 to 24911. [2024-10-14 05:15:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24911 states, 22627 states have (on average 1.57731913201043) internal successors, (35690), 22710 states have internal predecessors, (35690), 1625 states have call successors, (1625), 538 states have call predecessors, (1625), 657 states have return successors, (2505), 1726 states have call predecessors, (2505), 1622 states have call successors, (2505) [2024-10-14 05:15:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24911 states to 24911 states and 39820 transitions. [2024-10-14 05:15:02,673 INFO L78 Accepts]: Start accepts. Automaton has 24911 states and 39820 transitions. Word has length 172 [2024-10-14 05:15:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:02,674 INFO L471 AbstractCegarLoop]: Abstraction has 24911 states and 39820 transitions. [2024-10-14 05:15:02,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-14 05:15:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 24911 states and 39820 transitions. [2024-10-14 05:15:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:15:02,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:02,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:15:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 05:15:02,684 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -11599825, now seen corresponding path program 1 times [2024-10-14 05:15:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137264287] [2024-10-14 05:15:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:15:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:15:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:15:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:15:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:02,981 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-14 05:15:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137264287] [2024-10-14 05:15:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137264287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026088869] [2024-10-14 05:15:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:02,983 INFO L87 Difference]: Start difference. First operand 24911 states and 39820 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)