./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.08.cil-2.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.08.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:12:33,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:12:33,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:12:33,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:12:33,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:12:33,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:12:33,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:12:33,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:12:33,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:12:33,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:12:33,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:12:33,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:12:33,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:12:33,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:12:33,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:12:33,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:12:33,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:12:33,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:12:33,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:12:33,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:12:33,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:12:33,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:12:33,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:12:33,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:12:33,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:12:33,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:12:33,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:12:33,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:12:33,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:12:33,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:12:33,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:12:33,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:12:33,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:12:33,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:12:33,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:12:33,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:12:33,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:12:33,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:12:33,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:12:33,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:12:33,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:12:33,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:12:33,945 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 -> dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b [2024-10-14 05:12:34,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:12:34,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:12:34,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:12:34,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:12:34,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:12:34,192 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.08.cil-2.c [2024-10-14 05:12:35,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:12:35,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:12:35,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2024-10-14 05:12:35,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941da6579/44204878a9614d9180613a2d525a6045/FLAGb378240aa [2024-10-14 05:12:35,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941da6579/44204878a9614d9180613a2d525a6045 [2024-10-14 05:12:35,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:12:35,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:12:35,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:12:35,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:12:35,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:12:35,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:35" (1/1) ... [2024-10-14 05:12:35,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49515396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:35, skipping insertion in model container [2024-10-14 05:12:35,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:35" (1/1) ... [2024-10-14 05:12:35,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:12:36,052 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.08.cil-2.c[914,927] [2024-10-14 05:12:36,106 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.08.cil-2.c[7115,7128] [2024-10-14 05:12:36,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:12:36,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:12:36,194 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.08.cil-2.c[914,927] [2024-10-14 05:12:36,208 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.08.cil-2.c[7115,7128] [2024-10-14 05:12:36,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:12:36,262 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:12:36,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36 WrapperNode [2024-10-14 05:12:36,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:12:36,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:12:36,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:12:36,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:12:36,271 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:12:36" (1/1) ... [2024-10-14 05:12:36,281 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:12:36" (1/1) ... [2024-10-14 05:12:36,317 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 834 [2024-10-14 05:12:36,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:12:36,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:12:36,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:12:36,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:12:36,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,356 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:12:36,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:12:36,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:12:36,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:12:36,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:12:36,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (1/1) ... [2024-10-14 05:12:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:12:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:36,437 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:12:36,439 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:12:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:12:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:12:36,477 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:12:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:12:36,478 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:12:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:12:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:12:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:12:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:12:36,481 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:12:36,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:12:36,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:12:37,315 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-14 05:12:37,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:12:37,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:12:37,366 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-14 05:12:37,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:37 BoogieIcfgContainer [2024-10-14 05:12:37,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:12:37,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:12:37,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:12:37,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:12:37,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:35" (1/3) ... [2024-10-14 05:12:37,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e2f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:37, skipping insertion in model container [2024-10-14 05:12:37,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:36" (2/3) ... [2024-10-14 05:12:37,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e2f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:37, skipping insertion in model container [2024-10-14 05:12:37,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:37" (3/3) ... [2024-10-14 05:12:37,377 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2024-10-14 05:12:37,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:12:37,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:12:37,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:12:37,450 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;@54292664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:12:37,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:12:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 355 states, 299 states have (on average 1.7023411371237458) internal successors, (509), 307 states have internal predecessors, (509), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 05:12:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:12:37,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:37,465 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:12:37,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:37,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1642674397, now seen corresponding path program 1 times [2024-10-14 05:12:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756773179] [2024-10-14 05:12:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:37,932 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:12:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756773179] [2024-10-14 05:12:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756773179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391217339] [2024-10-14 05:12:37,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:37,978 INFO L87 Difference]: Start difference. First operand has 355 states, 299 states have (on average 1.7023411371237458) internal successors, (509), 307 states have internal predecessors, (509), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) 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:12:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:39,285 INFO L93 Difference]: Finished difference Result 813 states and 1329 transitions. [2024-10-14 05:12:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:12:39,289 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:12:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:39,304 INFO L225 Difference]: With dead ends: 813 [2024-10-14 05:12:39,304 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 05:12:39,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:12:39,316 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 665 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:39,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1426 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:12:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 05:12:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 437. [2024-10-14 05:12:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 364 states have (on average 1.5631868131868132) internal successors, (569), 371 states have internal predecessors, (569), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2024-10-14 05:12:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 668 transitions. [2024-10-14 05:12:39,382 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 668 transitions. Word has length 58 [2024-10-14 05:12:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:39,383 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 668 transitions. [2024-10-14 05:12:39,383 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:12:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 668 transitions. [2024-10-14 05:12:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:12:39,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:39,385 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:12:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:12:39,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:39,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1776908061, now seen corresponding path program 1 times [2024-10-14 05:12:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836061993] [2024-10-14 05:12:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:39,531 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:12:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836061993] [2024-10-14 05:12:39,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836061993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304535469] [2024-10-14 05:12:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:39,534 INFO L87 Difference]: Start difference. First operand 437 states and 668 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:12:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:40,743 INFO L93 Difference]: Finished difference Result 757 states and 1118 transitions. [2024-10-14 05:12:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:12:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:12:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:40,749 INFO L225 Difference]: With dead ends: 757 [2024-10-14 05:12:40,750 INFO L226 Difference]: Without dead ends: 595 [2024-10-14 05:12:40,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:12:40,752 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1327 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:40,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1396 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:12:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-14 05:12:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 525. [2024-10-14 05:12:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 432 states have (on average 1.5393518518518519) internal successors, (665), 441 states have internal predecessors, (665), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2024-10-14 05:12:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 794 transitions. [2024-10-14 05:12:40,810 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 794 transitions. Word has length 58 [2024-10-14 05:12:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 794 transitions. [2024-10-14 05:12:40,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:12:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 794 transitions. [2024-10-14 05:12:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:12:40,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:40,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:40,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:12:40,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 151364641, now seen corresponding path program 1 times [2024-10-14 05:12:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565498352] [2024-10-14 05:12:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:41,046 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:12:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565498352] [2024-10-14 05:12:41,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565498352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:41,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:41,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:12:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383431378] [2024-10-14 05:12:41,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:41,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:12:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:12:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:41,052 INFO L87 Difference]: Start difference. First operand 525 states and 794 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:12:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:42,013 INFO L93 Difference]: Finished difference Result 799 states and 1180 transitions. [2024-10-14 05:12:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:12:42,013 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:12:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:42,017 INFO L225 Difference]: With dead ends: 799 [2024-10-14 05:12:42,017 INFO L226 Difference]: Without dead ends: 555 [2024-10-14 05:12:42,018 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:12:42,019 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 685 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:42,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1739 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:12:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-14 05:12:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 529. [2024-10-14 05:12:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 435 states have (on average 1.5310344827586206) internal successors, (666), 444 states have internal predecessors, (666), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2024-10-14 05:12:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 796 transitions. [2024-10-14 05:12:42,060 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 796 transitions. Word has length 58 [2024-10-14 05:12:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:42,060 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 796 transitions. [2024-10-14 05:12:42,060 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:12:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 796 transitions. [2024-10-14 05:12:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:12:42,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:42,062 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:12:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:12:42,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2092618657, now seen corresponding path program 1 times [2024-10-14 05:12:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502138585] [2024-10-14 05:12:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:42,219 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:12:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502138585] [2024-10-14 05:12:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502138585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:42,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:12:42,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123871504] [2024-10-14 05:12:42,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:42,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:12:42,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:12:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:12:42,223 INFO L87 Difference]: Start difference. First operand 529 states and 796 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:12:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:43,903 INFO L93 Difference]: Finished difference Result 1753 states and 2494 transitions. [2024-10-14 05:12:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:12:43,904 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:12:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:43,910 INFO L225 Difference]: With dead ends: 1753 [2024-10-14 05:12:43,910 INFO L226 Difference]: Without dead ends: 1487 [2024-10-14 05:12:43,912 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:12:43,913 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 2798 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:43,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 1883 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:12:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-10-14 05:12:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1364. [2024-10-14 05:12:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1084 states have (on average 1.419741697416974) internal successors, (1539), 1108 states have internal predecessors, (1539), 148 states have call successors, (148), 112 states have call predecessors, (148), 130 states have return successors, (184), 146 states have call predecessors, (184), 144 states have call successors, (184) [2024-10-14 05:12:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1871 transitions. [2024-10-14 05:12:43,982 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1871 transitions. Word has length 58 [2024-10-14 05:12:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:43,982 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1871 transitions. [2024-10-14 05:12:43,982 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:12:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1871 transitions. [2024-10-14 05:12:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:12:43,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:43,983 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:12:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:12:43,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:43,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1187131728, now seen corresponding path program 1 times [2024-10-14 05:12:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131579496] [2024-10-14 05:12:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:44,114 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:12:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131579496] [2024-10-14 05:12:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131579496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:12:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162694169] [2024-10-14 05:12:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:44,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:12:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:12:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:44,120 INFO L87 Difference]: Start difference. First operand 1364 states and 1871 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:12:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:45,115 INFO L93 Difference]: Finished difference Result 2553 states and 3442 transitions. [2024-10-14 05:12:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:12:45,116 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:12:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:45,121 INFO L225 Difference]: With dead ends: 2553 [2024-10-14 05:12:45,121 INFO L226 Difference]: Without dead ends: 1458 [2024-10-14 05:12:45,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:12:45,124 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 464 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:45,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1954 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:12:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-10-14 05:12:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1388. [2024-10-14 05:12:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1102 states have (on average 1.4056261343012704) internal successors, (1549), 1126 states have internal predecessors, (1549), 148 states have call successors, (148), 112 states have call predecessors, (148), 136 states have return successors, (190), 152 states have call predecessors, (190), 144 states have call successors, (190) [2024-10-14 05:12:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1887 transitions. [2024-10-14 05:12:45,245 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1887 transitions. Word has length 59 [2024-10-14 05:12:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1887 transitions. [2024-10-14 05:12:45,248 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:12:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1887 transitions. [2024-10-14 05:12:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:12:45,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:45,250 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:12:45,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:12:45,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:45,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 736096306, now seen corresponding path program 1 times [2024-10-14 05:12:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:45,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520242580] [2024-10-14 05:12:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:45,441 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:12:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520242580] [2024-10-14 05:12:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520242580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431572261] [2024-10-14 05:12:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:45,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:45,445 INFO L87 Difference]: Start difference. First operand 1388 states and 1887 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:12:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:46,679 INFO L93 Difference]: Finished difference Result 2538 states and 3329 transitions. [2024-10-14 05:12:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:12:46,679 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:12:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:46,686 INFO L225 Difference]: With dead ends: 2538 [2024-10-14 05:12:46,686 INFO L226 Difference]: Without dead ends: 1626 [2024-10-14 05:12:46,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:12:46,689 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1061 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1418 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:12:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-14 05:12:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1333. [2024-10-14 05:12:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1063 states have (on average 1.4026340545625589) internal successors, (1491), 1082 states have internal predecessors, (1491), 142 states have call successors, (142), 107 states have call predecessors, (142), 126 states have return successors, (175), 145 states have call predecessors, (175), 138 states have call successors, (175) [2024-10-14 05:12:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1808 transitions. [2024-10-14 05:12:46,755 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1808 transitions. Word has length 59 [2024-10-14 05:12:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:46,755 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1808 transitions. [2024-10-14 05:12:46,755 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:12:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1808 transitions. [2024-10-14 05:12:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:12:46,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:46,756 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:12:46,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:12:46,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:46,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 954951024, now seen corresponding path program 1 times [2024-10-14 05:12:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115516273] [2024-10-14 05:12:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:46,838 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:12:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115516273] [2024-10-14 05:12:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115516273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658463033] [2024-10-14 05:12:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:46,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:46,840 INFO L87 Difference]: Start difference. First operand 1333 states and 1808 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:12:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:47,522 INFO L93 Difference]: Finished difference Result 3482 states and 4579 transitions. [2024-10-14 05:12:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:12:47,523 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:12:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:47,534 INFO L225 Difference]: With dead ends: 3482 [2024-10-14 05:12:47,535 INFO L226 Difference]: Without dead ends: 2419 [2024-10-14 05:12:47,537 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:12:47,538 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 1561 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:47,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 747 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:12:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-14 05:12:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2303. [2024-10-14 05:12:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1790 states have (on average 1.335195530726257) internal successors, (2390), 1826 states have internal predecessors, (2390), 261 states have call successors, (261), 206 states have call predecessors, (261), 250 states have return successors, (366), 273 states have call predecessors, (366), 257 states have call successors, (366) [2024-10-14 05:12:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3017 transitions. [2024-10-14 05:12:47,682 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3017 transitions. Word has length 59 [2024-10-14 05:12:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:47,682 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 3017 transitions. [2024-10-14 05:12:47,682 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:12:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3017 transitions. [2024-10-14 05:12:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:12:47,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:47,683 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:12:47,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:12:47,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 221499874, now seen corresponding path program 1 times [2024-10-14 05:12:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662535971] [2024-10-14 05:12:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:47,755 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:12:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662535971] [2024-10-14 05:12:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662535971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:12:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089335076] [2024-10-14 05:12:47,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:47,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:47,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:47,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:12:47,757 INFO L87 Difference]: Start difference. First operand 2303 states and 3017 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:12:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:48,601 INFO L93 Difference]: Finished difference Result 5355 states and 6898 transitions. [2024-10-14 05:12:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:12:48,601 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:12:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:48,616 INFO L225 Difference]: With dead ends: 5355 [2024-10-14 05:12:48,616 INFO L226 Difference]: Without dead ends: 3327 [2024-10-14 05:12:48,620 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:12:48,621 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 899 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:48,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 951 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:12:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2024-10-14 05:12:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3069. [2024-10-14 05:12:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2370 states have (on average 1.3151898734177214) internal successors, (3117), 2411 states have internal predecessors, (3117), 353 states have call successors, (353), 286 states have call predecessors, (353), 344 states have return successors, (480), 374 states have call predecessors, (480), 349 states have call successors, (480) [2024-10-14 05:12:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 3950 transitions. [2024-10-14 05:12:48,907 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 3950 transitions. Word has length 60 [2024-10-14 05:12:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 3950 transitions. [2024-10-14 05:12:48,908 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:12:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 3950 transitions. [2024-10-14 05:12:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:12:48,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:48,911 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:12:48,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:12:48,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:48,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1574263521, now seen corresponding path program 1 times [2024-10-14 05:12:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495170946] [2024-10-14 05:12:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:48,990 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:12:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495170946] [2024-10-14 05:12:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495170946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:48,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:48,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:12:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037549101] [2024-10-14 05:12:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:48,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:12:48,992 INFO L87 Difference]: Start difference. First operand 3069 states and 3950 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:12:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:49,922 INFO L93 Difference]: Finished difference Result 6633 states and 8416 transitions. [2024-10-14 05:12:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:12:49,923 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:12:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:49,937 INFO L225 Difference]: With dead ends: 6633 [2024-10-14 05:12:49,937 INFO L226 Difference]: Without dead ends: 3837 [2024-10-14 05:12:49,941 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:12:49,943 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1007 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:49,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1014 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:12:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2024-10-14 05:12:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3573. [2024-10-14 05:12:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2760 states have (on average 1.3068840579710146) internal successors, (3607), 2805 states have internal predecessors, (3607), 409 states have call successors, (409), 336 states have call predecessors, (409), 402 states have return successors, (553), 434 states have call predecessors, (553), 405 states have call successors, (553) [2024-10-14 05:12:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4569 transitions. [2024-10-14 05:12:50,171 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4569 transitions. Word has length 66 [2024-10-14 05:12:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:50,172 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 4569 transitions. [2024-10-14 05:12:50,172 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:12:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4569 transitions. [2024-10-14 05:12:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:12:50,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:50,176 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:12:50,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:12:50,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1040856206, now seen corresponding path program 1 times [2024-10-14 05:12:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:50,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056874667] [2024-10-14 05:12:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:50,274 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:12:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056874667] [2024-10-14 05:12:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056874667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604187162] [2024-10-14 05:12:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:50,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:50,279 INFO L87 Difference]: Start difference. First operand 3573 states and 4569 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:12:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:51,138 INFO L93 Difference]: Finished difference Result 4581 states and 5786 transitions. [2024-10-14 05:12:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:12:51,138 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:12:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:51,153 INFO L225 Difference]: With dead ends: 4581 [2024-10-14 05:12:51,153 INFO L226 Difference]: Without dead ends: 4578 [2024-10-14 05:12:51,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:12:51,155 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1773 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:51,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 764 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:12:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2024-10-14 05:12:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 3993. [2024-10-14 05:12:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3073 states have (on average 1.2954767328343637) internal successors, (3981), 3121 states have internal predecessors, (3981), 459 states have call successors, (459), 380 states have call predecessors, (459), 459 states have return successors, (630), 494 states have call predecessors, (630), 456 states have call successors, (630) [2024-10-14 05:12:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 5070 transitions. [2024-10-14 05:12:51,411 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 5070 transitions. Word has length 67 [2024-10-14 05:12:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:51,411 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 5070 transitions. [2024-10-14 05:12:51,412 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:12:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 5070 transitions. [2024-10-14 05:12:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:12:51,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:51,413 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:12:51,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:12:51,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2094372661, now seen corresponding path program 1 times [2024-10-14 05:12:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132228176] [2024-10-14 05:12:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,554 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:12:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132228176] [2024-10-14 05:12:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132228176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366662715] [2024-10-14 05:12:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:51,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:51,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:51,560 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:12:51,565 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:12:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:51,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:12:51,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:52,056 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:12:52,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:12:52,176 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:12:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366662715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:12:52,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:12:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:12:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442581813] [2024-10-14 05:12:52,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:12:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:12:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:12:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:12:52,179 INFO L87 Difference]: Start difference. First operand 3993 states and 5070 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:12:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:54,494 INFO L93 Difference]: Finished difference Result 7965 states and 9933 transitions. [2024-10-14 05:12:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 05:12:54,496 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:12:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:54,549 INFO L225 Difference]: With dead ends: 7965 [2024-10-14 05:12:54,549 INFO L226 Difference]: Without dead ends: 7962 [2024-10-14 05:12:54,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-14 05:12:54,556 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1457 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:54,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1997 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:12:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2024-10-14 05:12:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7110. [2024-10-14 05:12:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5448 states have (on average 1.2782672540381792) internal successors, (6964), 5531 states have internal predecessors, (6964), 818 states have call successors, (818), 694 states have call predecessors, (818), 842 states have return successors, (1131), 887 states have call predecessors, (1131), 815 states have call successors, (1131) [2024-10-14 05:12:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 8913 transitions. [2024-10-14 05:12:55,209 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 8913 transitions. Word has length 68 [2024-10-14 05:12:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:55,210 INFO L471 AbstractCegarLoop]: Abstraction has 7110 states and 8913 transitions. [2024-10-14 05:12:55,210 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:12:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 8913 transitions. [2024-10-14 05:12:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:55,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:55,212 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:12:55,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:55,413 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,SelfDestructingSolverStorable10 [2024-10-14 05:12:55,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:55,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1832774066, now seen corresponding path program 2 times [2024-10-14 05:12:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:55,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269465563] [2024-10-14 05:12:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:55,474 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:12:55,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269465563] [2024-10-14 05:12:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269465563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:12:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058277900] [2024-10-14 05:12:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:12:55,476 INFO L87 Difference]: Start difference. First operand 7110 states and 8913 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:12:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:57,215 INFO L93 Difference]: Finished difference Result 9498 states and 11916 transitions. [2024-10-14 05:12:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:12:57,224 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:12:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:57,244 INFO L225 Difference]: With dead ends: 9498 [2024-10-14 05:12:57,248 INFO L226 Difference]: Without dead ends: 3860 [2024-10-14 05:12:57,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:12:57,268 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 955 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:57,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1053 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:12:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3860 states. [2024-10-14 05:12:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3860 to 2924. [2024-10-14 05:12:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2268 states have (on average 1.2861552028218695) internal successors, (2917), 2297 states have internal predecessors, (2917), 337 states have call successors, (337), 276 states have call predecessors, (337), 317 states have return successors, (430), 353 states have call predecessors, (430), 334 states have call successors, (430) [2024-10-14 05:12:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3684 transitions. [2024-10-14 05:12:57,616 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3684 transitions. Word has length 71 [2024-10-14 05:12:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:57,617 INFO L471 AbstractCegarLoop]: Abstraction has 2924 states and 3684 transitions. [2024-10-14 05:12:57,617 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:12:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3684 transitions. [2024-10-14 05:12:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:12:57,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:57,620 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:12:57,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:12:57,620 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:57,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash -760462493, now seen corresponding path program 1 times [2024-10-14 05:12:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604900788] [2024-10-14 05:12:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:57,747 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:12:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604900788] [2024-10-14 05:12:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604900788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014121965] [2024-10-14 05:12:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:57,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:57,749 INFO L87 Difference]: Start difference. First operand 2924 states and 3684 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:12:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:59,291 INFO L93 Difference]: Finished difference Result 8242 states and 10215 transitions. [2024-10-14 05:12:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:12:59,292 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:12:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:59,319 INFO L225 Difference]: With dead ends: 8242 [2024-10-14 05:12:59,320 INFO L226 Difference]: Without dead ends: 4852 [2024-10-14 05:12:59,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:12:59,329 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1198 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:59,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1268 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:12:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2024-10-14 05:12:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 4592. [2024-10-14 05:12:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4592 states, 3501 states have (on average 1.2479291630962581) internal successors, (4369), 3567 states have internal predecessors, (4369), 537 states have call successors, (537), 448 states have call predecessors, (537), 552 states have return successors, (780), 579 states have call predecessors, (780), 534 states have call successors, (780) [2024-10-14 05:12:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4592 states to 4592 states and 5686 transitions. [2024-10-14 05:12:59,769 INFO L78 Accepts]: Start accepts. Automaton has 4592 states and 5686 transitions. Word has length 76 [2024-10-14 05:12:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 4592 states and 5686 transitions. [2024-10-14 05:12:59,770 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:12:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4592 states and 5686 transitions. [2024-10-14 05:12:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:12:59,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:59,772 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:12:59,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:12:59,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:59,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1653971837, now seen corresponding path program 1 times [2024-10-14 05:12:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061949153] [2024-10-14 05:12:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:59,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:12:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,878 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:12:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061949153] [2024-10-14 05:12:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061949153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:12:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783814471] [2024-10-14 05:12:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:12:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:12:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:59,879 INFO L87 Difference]: Start difference. First operand 4592 states and 5686 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:13:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:01,218 INFO L93 Difference]: Finished difference Result 7682 states and 9434 transitions. [2024-10-14 05:13:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:13:01,219 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:13:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:01,262 INFO L225 Difference]: With dead ends: 7682 [2024-10-14 05:13:01,263 INFO L226 Difference]: Without dead ends: 3839 [2024-10-14 05:13:01,280 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:13:01,281 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 2185 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:01,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2220 Valid, 1263 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:13:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2024-10-14 05:13:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3435. [2024-10-14 05:13:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2610 states have (on average 1.236015325670498) internal successors, (3226), 2664 states have internal predecessors, (3226), 402 states have call successors, (402), 330 states have call predecessors, (402), 421 states have return successors, (549), 443 states have call predecessors, (549), 399 states have call successors, (549) [2024-10-14 05:13:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4177 transitions. [2024-10-14 05:13:01,819 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4177 transitions. Word has length 86 [2024-10-14 05:13:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:01,819 INFO L471 AbstractCegarLoop]: Abstraction has 3435 states and 4177 transitions. [2024-10-14 05:13:01,819 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:13:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4177 transitions. [2024-10-14 05:13:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:13:01,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:01,822 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:13:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:13:01,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -879376531, now seen corresponding path program 1 times [2024-10-14 05:13:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917410784] [2024-10-14 05:13:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:13:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:13:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:13:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:13:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:13:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:13:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,030 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:13:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917410784] [2024-10-14 05:13:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917410784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584530340] [2024-10-14 05:13:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:02,037 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:13:02,050 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:13:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:13:02,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:02,191 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:13:02,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:13:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584530340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:13:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:13:02,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663864656] [2024-10-14 05:13:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:02,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:02,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:02,193 INFO L87 Difference]: Start difference. First operand 3435 states and 4177 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:13:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:02,394 INFO L93 Difference]: Finished difference Result 5026 states and 6085 transitions. [2024-10-14 05:13:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:13:02,395 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:13:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:02,402 INFO L225 Difference]: With dead ends: 5026 [2024-10-14 05:13:02,402 INFO L226 Difference]: Without dead ends: 1866 [2024-10-14 05:13:02,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:02,407 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 0 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:02,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2488 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:13:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2024-10-14 05:13:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2024-10-14 05:13:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1487 states have (on average 1.2595830531271015) internal successors, (1873), 1504 states have internal predecessors, (1873), 191 states have call successors, (191), 144 states have call predecessors, (191), 186 states have return successors, (256), 218 states have call predecessors, (256), 188 states have call successors, (256) [2024-10-14 05:13:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2320 transitions. [2024-10-14 05:13:02,521 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2320 transitions. Word has length 131 [2024-10-14 05:13:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:02,521 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2320 transitions. [2024-10-14 05:13:02,521 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:13:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2320 transitions. [2024-10-14 05:13:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:02,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:02,523 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] [2024-10-14 05:13:02,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:13:02,727 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,SelfDestructingSolverStorable14 [2024-10-14 05:13:02,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:02,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash 550923923, now seen corresponding path program 1 times [2024-10-14 05:13:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:02,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422702160] [2024-10-14 05:13:02,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:02,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422702160] [2024-10-14 05:13:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422702160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:13:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386471750] [2024-10-14 05:13:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:02,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:13:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:13:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:13:02,837 INFO L87 Difference]: Start difference. First operand 1866 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:13:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:04,181 INFO L93 Difference]: Finished difference Result 2208 states and 2885 transitions. [2024-10-14 05:13:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:04,187 INFO L225 Difference]: With dead ends: 2208 [2024-10-14 05:13:04,187 INFO L226 Difference]: Without dead ends: 1956 [2024-10-14 05:13:04,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:04,189 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 796 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:04,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 695 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:13:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2024-10-14 05:13:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1866. [2024-10-14 05:13:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1487 states have (on average 1.2589105581708138) internal successors, (1872), 1504 states have internal predecessors, (1872), 191 states have call successors, (191), 144 states have call predecessors, (191), 186 states have return successors, (256), 218 states have call predecessors, (256), 188 states have call successors, (256) [2024-10-14 05:13:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2319 transitions. [2024-10-14 05:13:04,396 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2319 transitions. Word has length 122 [2024-10-14 05:13:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:04,396 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2319 transitions. [2024-10-14 05:13:04,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:13:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2319 transitions. [2024-10-14 05:13:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:04,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:04,398 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] [2024-10-14 05:13:04,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:13:04,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:04,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2096680431, now seen corresponding path program 1 times [2024-10-14 05:13:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:04,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691915991] [2024-10-14 05:13:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,569 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:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:04,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691915991] [2024-10-14 05:13:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691915991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120748404] [2024-10-14 05:13:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:04,571 INFO L87 Difference]: Start difference. First operand 1866 states and 2319 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:13:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:06,962 INFO L93 Difference]: Finished difference Result 2551 states and 3453 transitions. [2024-10-14 05:13:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:06,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:06,969 INFO L225 Difference]: With dead ends: 2551 [2024-10-14 05:13:06,969 INFO L226 Difference]: Without dead ends: 2304 [2024-10-14 05:13:06,971 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:13:06,971 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 1257 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:06,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1007 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 05:13:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-14 05:13:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2123. [2024-10-14 05:13:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1720 states have (on average 1.3104651162790697) internal successors, (2254), 1738 states have internal predecessors, (2254), 208 states have call successors, (208), 150 states have call predecessors, (208), 193 states have return successors, (276), 235 states have call predecessors, (276), 205 states have call successors, (276) [2024-10-14 05:13:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2738 transitions. [2024-10-14 05:13:07,269 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2738 transitions. Word has length 122 [2024-10-14 05:13:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 2738 transitions. [2024-10-14 05:13:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:13:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2738 transitions. [2024-10-14 05:13:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:07,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:07,271 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] [2024-10-14 05:13:07,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:13:07,272 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1922361553, now seen corresponding path program 1 times [2024-10-14 05:13:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:07,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968238078] [2024-10-14 05:13:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,436 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:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968238078] [2024-10-14 05:13:07,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968238078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:07,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:07,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:07,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831507405] [2024-10-14 05:13:07,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:07,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:07,438 INFO L87 Difference]: Start difference. First operand 2123 states and 2738 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:10,081 INFO L93 Difference]: Finished difference Result 3166 states and 4463 transitions. [2024-10-14 05:13:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:10,093 INFO L225 Difference]: With dead ends: 3166 [2024-10-14 05:13:10,093 INFO L226 Difference]: Without dead ends: 2662 [2024-10-14 05:13:10,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:10,095 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 1274 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:10,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1792 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:13:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2024-10-14 05:13:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2361. [2024-10-14 05:13:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1934 states have (on average 1.343329886246122) internal successors, (2598), 1953 states have internal predecessors, (2598), 225 states have call successors, (225), 156 states have call predecessors, (225), 200 states have return successors, (295), 253 states have call predecessors, (295), 222 states have call successors, (295) [2024-10-14 05:13:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3118 transitions. [2024-10-14 05:13:10,395 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3118 transitions. Word has length 122 [2024-10-14 05:13:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:10,397 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3118 transitions. [2024-10-14 05:13:10,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3118 transitions. [2024-10-14 05:13:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:10,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:10,403 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] [2024-10-14 05:13:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:13:10,403 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -983311729, now seen corresponding path program 1 times [2024-10-14 05:13:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052342298] [2024-10-14 05:13:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,608 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:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052342298] [2024-10-14 05:13:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052342298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:10,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451980723] [2024-10-14 05:13:10,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:10,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:10,611 INFO L87 Difference]: Start difference. First operand 2361 states and 3118 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:13,252 INFO L93 Difference]: Finished difference Result 4067 states and 5935 transitions. [2024-10-14 05:13:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:13,261 INFO L225 Difference]: With dead ends: 4067 [2024-10-14 05:13:13,261 INFO L226 Difference]: Without dead ends: 3325 [2024-10-14 05:13:13,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:13,264 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1278 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2896 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:13,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 1790 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2896 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:13:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2024-10-14 05:13:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 2838. [2024-10-14 05:13:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2363 states have (on average 1.3910283537875583) internal successors, (3287), 2384 states have internal predecessors, (3287), 259 states have call successors, (259), 168 states have call predecessors, (259), 214 states have return successors, (337), 289 states have call predecessors, (337), 256 states have call successors, (337) [2024-10-14 05:13:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3883 transitions. [2024-10-14 05:13:13,530 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3883 transitions. Word has length 122 [2024-10-14 05:13:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:13,530 INFO L471 AbstractCegarLoop]: Abstraction has 2838 states and 3883 transitions. [2024-10-14 05:13:13,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3883 transitions. [2024-10-14 05:13:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:13,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:13,533 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] [2024-10-14 05:13:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:13:13,534 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:13,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1278261521, now seen corresponding path program 1 times [2024-10-14 05:13:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243023213] [2024-10-14 05:13:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,677 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:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243023213] [2024-10-14 05:13:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243023213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161963076] [2024-10-14 05:13:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:13,680 INFO L87 Difference]: Start difference. First operand 2838 states and 3883 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:15,020 INFO L93 Difference]: Finished difference Result 4528 states and 6683 transitions. [2024-10-14 05:13:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:15,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:15,031 INFO L225 Difference]: With dead ends: 4528 [2024-10-14 05:13:15,032 INFO L226 Difference]: Without dead ends: 3309 [2024-10-14 05:13:15,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:15,037 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1140 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:15,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 850 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:13:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-10-14 05:13:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2838. [2024-10-14 05:13:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2363 states have (on average 1.388912399492171) internal successors, (3282), 2384 states have internal predecessors, (3282), 259 states have call successors, (259), 168 states have call predecessors, (259), 214 states have return successors, (337), 289 states have call predecessors, (337), 256 states have call successors, (337) [2024-10-14 05:13:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3878 transitions. [2024-10-14 05:13:15,492 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3878 transitions. Word has length 122 [2024-10-14 05:13:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 2838 states and 3878 transitions. [2024-10-14 05:13:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3878 transitions. [2024-10-14 05:13:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:15,497 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] [2024-10-14 05:13:15,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:13:15,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash -28880877, now seen corresponding path program 1 times [2024-10-14 05:13:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834939257] [2024-10-14 05:13:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:15,674 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:15,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:15,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834939257] [2024-10-14 05:13:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834939257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144879668] [2024-10-14 05:13:15,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:15,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:15,678 INFO L87 Difference]: Start difference. First operand 2838 states and 3878 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:17,283 INFO L93 Difference]: Finished difference Result 4522 states and 6656 transitions. [2024-10-14 05:13:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:17,295 INFO L225 Difference]: With dead ends: 4522 [2024-10-14 05:13:17,295 INFO L226 Difference]: Without dead ends: 3303 [2024-10-14 05:13:17,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:17,300 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 982 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:17,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 1022 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2024-10-14 05:13:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2838. [2024-10-14 05:13:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2363 states have (on average 1.3867964451967838) internal successors, (3277), 2384 states have internal predecessors, (3277), 259 states have call successors, (259), 168 states have call predecessors, (259), 214 states have return successors, (337), 289 states have call predecessors, (337), 256 states have call successors, (337) [2024-10-14 05:13:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3873 transitions. [2024-10-14 05:13:17,628 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3873 transitions. Word has length 122 [2024-10-14 05:13:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:17,629 INFO L471 AbstractCegarLoop]: Abstraction has 2838 states and 3873 transitions. [2024-10-14 05:13:17,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3873 transitions. [2024-10-14 05:13:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:17,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:17,632 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] [2024-10-14 05:13:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:13:17,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1868615889, now seen corresponding path program 1 times [2024-10-14 05:13:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678940768] [2024-10-14 05:13:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:17,792 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:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678940768] [2024-10-14 05:13:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678940768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794724286] [2024-10-14 05:13:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:17,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:17,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:17,795 INFO L87 Difference]: Start difference. First operand 2838 states and 3873 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:20,669 INFO L93 Difference]: Finished difference Result 5781 states and 8672 transitions. [2024-10-14 05:13:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:20,684 INFO L225 Difference]: With dead ends: 5781 [2024-10-14 05:13:20,685 INFO L226 Difference]: Without dead ends: 4562 [2024-10-14 05:13:20,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:20,689 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1260 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:20,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1790 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:13:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2024-10-14 05:13:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 3808. [2024-10-14 05:13:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3808 states, 3237 states have (on average 1.4423849243126352) internal successors, (4669), 3262 states have internal predecessors, (4669), 327 states have call successors, (327), 192 states have call predecessors, (327), 242 states have return successors, (427), 361 states have call predecessors, (427), 324 states have call successors, (427) [2024-10-14 05:13:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5423 transitions. [2024-10-14 05:13:21,202 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5423 transitions. Word has length 122 [2024-10-14 05:13:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:21,203 INFO L471 AbstractCegarLoop]: Abstraction has 3808 states and 5423 transitions. [2024-10-14 05:13:21,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5423 transitions. [2024-10-14 05:13:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:21,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:13:21,207 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1395310509, now seen corresponding path program 1 times [2024-10-14 05:13:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:21,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499161573] [2024-10-14 05:13:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:21,374 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:21,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:21,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499161573] [2024-10-14 05:13:21,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499161573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:21,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:21,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:21,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658192132] [2024-10-14 05:13:21,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:21,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:21,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:21,376 INFO L87 Difference]: Start difference. First operand 3808 states and 5423 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:22,870 INFO L93 Difference]: Finished difference Result 6758 states and 10263 transitions. [2024-10-14 05:13:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:22,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:22,881 INFO L225 Difference]: With dead ends: 6758 [2024-10-14 05:13:22,881 INFO L226 Difference]: Without dead ends: 4569 [2024-10-14 05:13:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:22,885 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 981 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1022 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2024-10-14 05:13:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 3808. [2024-10-14 05:13:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3808 states, 3237 states have (on average 1.4396045721346926) internal successors, (4660), 3262 states have internal predecessors, (4660), 327 states have call successors, (327), 192 states have call predecessors, (327), 242 states have return successors, (427), 361 states have call predecessors, (427), 324 states have call successors, (427) [2024-10-14 05:13:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5414 transitions. [2024-10-14 05:13:23,350 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5414 transitions. Word has length 122 [2024-10-14 05:13:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:23,350 INFO L471 AbstractCegarLoop]: Abstraction has 3808 states and 5414 transitions. [2024-10-14 05:13:23,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5414 transitions. [2024-10-14 05:13:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:23,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:23,356 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] [2024-10-14 05:13:23,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:13:23,356 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:23,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:23,357 INFO L85 PathProgramCache]: Analyzing trace with hash 993253521, now seen corresponding path program 1 times [2024-10-14 05:13:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683766949] [2024-10-14 05:13:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,591 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:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683766949] [2024-10-14 05:13:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683766949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:23,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646057542] [2024-10-14 05:13:23,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:23,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:23,594 INFO L87 Difference]: Start difference. First operand 3808 states and 5414 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:26,672 INFO L93 Difference]: Finished difference Result 9235 states and 14216 transitions. [2024-10-14 05:13:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:26,694 INFO L225 Difference]: With dead ends: 9235 [2024-10-14 05:13:26,694 INFO L226 Difference]: Without dead ends: 7046 [2024-10-14 05:13:26,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:26,704 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1252 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:26,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1790 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:13:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states. [2024-10-14 05:13:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 5758. [2024-10-14 05:13:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 4995 states have (on average 1.4902902902902904) internal successors, (7444), 5028 states have internal predecessors, (7444), 463 states have call successors, (463), 240 states have call predecessors, (463), 298 states have return successors, (625), 505 states have call predecessors, (625), 460 states have call successors, (625) [2024-10-14 05:13:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 8532 transitions. [2024-10-14 05:13:27,247 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 8532 transitions. Word has length 122 [2024-10-14 05:13:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:27,248 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 8532 transitions. [2024-10-14 05:13:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 8532 transitions. [2024-10-14 05:13:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:27,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:27,252 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] [2024-10-14 05:13:27,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:13:27,252 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1700642669, now seen corresponding path program 1 times [2024-10-14 05:13:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079673579] [2024-10-14 05:13:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,384 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:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:27,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079673579] [2024-10-14 05:13:27,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079673579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800141403] [2024-10-14 05:13:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:27,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:27,386 INFO L87 Difference]: Start difference. First operand 5758 states and 8532 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:31,128 INFO L93 Difference]: Finished difference Result 17823 states and 28110 transitions. [2024-10-14 05:13:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:13:31,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:31,168 INFO L225 Difference]: With dead ends: 17823 [2024-10-14 05:13:31,168 INFO L226 Difference]: Without dead ends: 13684 [2024-10-14 05:13:31,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:31,179 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1325 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:31,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1783 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:13:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13684 states. [2024-10-14 05:13:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13684 to 9639. [2024-10-14 05:13:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9639 states, 8508 states have (on average 1.5296191819464033) internal successors, (13014), 8557 states have internal predecessors, (13014), 719 states have call successors, (719), 336 states have call predecessors, (719), 410 states have return successors, (1059), 777 states have call predecessors, (1059), 716 states have call successors, (1059) [2024-10-14 05:13:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9639 states to 9639 states and 14792 transitions. [2024-10-14 05:13:31,941 INFO L78 Accepts]: Start accepts. Automaton has 9639 states and 14792 transitions. Word has length 122 [2024-10-14 05:13:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 9639 states and 14792 transitions. [2024-10-14 05:13:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9639 states and 14792 transitions. [2024-10-14 05:13:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:31,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:31,947 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] [2024-10-14 05:13:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:13:31,947 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1537593425, now seen corresponding path program 1 times [2024-10-14 05:13:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285370769] [2024-10-14 05:13:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,121 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:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285370769] [2024-10-14 05:13:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285370769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806659426] [2024-10-14 05:13:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:32,124 INFO L87 Difference]: Start difference. First operand 9639 states and 14792 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:36,171 INFO L93 Difference]: Finished difference Result 32886 states and 52692 transitions. [2024-10-14 05:13:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:13:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:36,242 INFO L225 Difference]: With dead ends: 32886 [2024-10-14 05:13:36,242 INFO L226 Difference]: Without dead ends: 24866 [2024-10-14 05:13:36,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:36,264 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 1514 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:36,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1779 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2738 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:13:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24866 states. [2024-10-14 05:13:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24866 to 17080. [2024-10-14 05:13:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17080 states, 15229 states have (on average 1.5502002757896118) internal successors, (23608), 15310 states have internal predecessors, (23608), 1215 states have call successors, (1215), 528 states have call predecessors, (1215), 634 states have return successors, (2073), 1305 states have call predecessors, (2073), 1212 states have call successors, (2073) [2024-10-14 05:13:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17080 states to 17080 states and 26896 transitions. [2024-10-14 05:13:37,882 INFO L78 Accepts]: Start accepts. Automaton has 17080 states and 26896 transitions. Word has length 122 [2024-10-14 05:13:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:37,882 INFO L471 AbstractCegarLoop]: Abstraction has 17080 states and 26896 transitions. [2024-10-14 05:13:37,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17080 states and 26896 transitions. [2024-10-14 05:13:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:37,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:37,894 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] [2024-10-14 05:13:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:13:37,894 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1405988653, now seen corresponding path program 1 times [2024-10-14 05:13:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557797824] [2024-10-14 05:13:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,054 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:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557797824] [2024-10-14 05:13:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557797824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:38,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:38,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745356761] [2024-10-14 05:13:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:38,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:38,056 INFO L87 Difference]: Start difference. First operand 17080 states and 26896 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:44,047 INFO L93 Difference]: Finished difference Result 60771 states and 98662 transitions. [2024-10-14 05:13:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:13:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:44,402 INFO L225 Difference]: With dead ends: 60771 [2024-10-14 05:13:44,402 INFO L226 Difference]: Without dead ends: 45310 [2024-10-14 05:13:44,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:44,436 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1440 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:44,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1783 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:13:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45310 states. [2024-10-14 05:13:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45310 to 32346. [2024-10-14 05:13:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32346 states, 29087 states have (on average 1.5664729948086775) internal successors, (45564), 29232 states have internal predecessors, (45564), 2175 states have call successors, (2175), 912 states have call predecessors, (2175), 1082 states have return successors, (4555), 2329 states have call predecessors, (4555), 2172 states have call successors, (4555) [2024-10-14 05:13:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32346 states to 32346 states and 52294 transitions. [2024-10-14 05:13:47,662 INFO L78 Accepts]: Start accepts. Automaton has 32346 states and 52294 transitions. Word has length 122 [2024-10-14 05:13:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:47,662 INFO L471 AbstractCegarLoop]: Abstraction has 32346 states and 52294 transitions. [2024-10-14 05:13:47,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32346 states and 52294 transitions. [2024-10-14 05:13:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 05:13:47,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:47,677 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] [2024-10-14 05:13:47,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:13:47,677 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2005469653, now seen corresponding path program 1 times [2024-10-14 05:13:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364473902] [2024-10-14 05:13:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 05:13:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:13:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 05:13:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 05:13:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,803 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,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364473902] [2024-10-14 05:13:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364473902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594623664] [2024-10-14 05:13:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:47,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:47,805 INFO L87 Difference]: Start difference. First operand 32346 states and 52294 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:13:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:57,582 INFO L93 Difference]: Finished difference Result 117379 states and 193966 transitions. [2024-10-14 05:13:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:13:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 05:13:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:57,817 INFO L225 Difference]: With dead ends: 117379 [2024-10-14 05:13:57,817 INFO L226 Difference]: Without dead ends: 86652 [2024-10-14 05:13:57,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:57,892 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1404 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:57,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 1783 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:13:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86652 states.