./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.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.12.cil-1.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 a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:44:45,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:44:46,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:44:46,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:44:46,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:44:46,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:44:46,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:44:46,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:44:46,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:44:46,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:44:46,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:44:46,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:44:46,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:44:46,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:44:46,104 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:44:46,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:44:46,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:44:46,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:44:46,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:44:46,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:44:46,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:44:46,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:44:46,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:44:46,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:44:46,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:44:46,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:44:46,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:44:46,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:44:46,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:44:46,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:44:46,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:44:46,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:44:46,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:44:46,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:44:46,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:44:46,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:44:46,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:44:46,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:44:46,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:44:46,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:44:46,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:44:46,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:44:46,116 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 -> a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a [2024-10-12 21:44:46,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:44:46,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:44:46,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:44:46,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:44:46,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:44:46,436 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.12.cil-1.c [2024-10-12 21:44:47,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:44:48,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:44:48,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2024-10-12 21:44:48,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a048c2a/0035ebade53042129556d5a2e199a702/FLAG5194c8318 [2024-10-12 21:44:48,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a048c2a/0035ebade53042129556d5a2e199a702 [2024-10-12 21:44:48,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:44:48,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:44:48,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:44:48,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:44:48,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:44:48,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25976b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48, skipping insertion in model container [2024-10-12 21:44:48,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:44:48,389 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.12.cil-1.c[914,927] [2024-10-12 21:44:48,439 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.12.cil-1.c[7115,7128] [2024-10-12 21:44:48,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:44:48,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:44:48,556 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.12.cil-1.c[914,927] [2024-10-12 21:44:48,581 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.12.cil-1.c[7115,7128] [2024-10-12 21:44:48,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:44:48,691 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:44:48,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48 WrapperNode [2024-10-12 21:44:48,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:44:48,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:44:48,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:44:48,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:44:48,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,794 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1074 [2024-10-12 21:44:48,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:44:48,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:44:48,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:44:48,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:44:48,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,887 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-12 21:44:48,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:44:48,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:44:48,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:44:48,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:44:48,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (1/1) ... [2024-10-12 21:44:48,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:44:48,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:44:48,961 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-12 21:44:48,963 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-12 21:44:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:44:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:44:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:44:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:44:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:44:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:44:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:44:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:44:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:44:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:44:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:44:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:44:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:44:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:44:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:44:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:44:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:44:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:44:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:44:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:44:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:44:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:44:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:44:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:44:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:44:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:44:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:44:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:44:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:44:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:44:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:44:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:44:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:44:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:44:49,137 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:44:49,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:44:50,087 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-12 21:44:50,087 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:44:50,170 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:44:50,170 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-12 21:44:50,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:44:50 BoogieIcfgContainer [2024-10-12 21:44:50,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:44:50,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:44:50,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:44:50,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:44:50,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:44:48" (1/3) ... [2024-10-12 21:44:50,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0018f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:44:50, skipping insertion in model container [2024-10-12 21:44:50,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:44:48" (2/3) ... [2024-10-12 21:44:50,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0018f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:44:50, skipping insertion in model container [2024-10-12 21:44:50,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:44:50" (3/3) ... [2024-10-12 21:44:50,182 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2024-10-12 21:44:50,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:44:50,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:44:50,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:44:50,294 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;@5cf32b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:44:50,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:44:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 387 states have (on average 1.7183462532299743) internal successors, (665), 395 states have internal predecessors, (665), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-12 21:44:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:44:50,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:50,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:44:50,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:50,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2145681840, now seen corresponding path program 1 times [2024-10-12 21:44:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972099624] [2024-10-12 21:44:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:50,823 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-12 21:44:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972099624] [2024-10-12 21:44:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972099624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:44:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861389613] [2024-10-12 21:44:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:44:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:44:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:44:50,861 INFO L87 Difference]: Start difference. First operand has 447 states, 387 states have (on average 1.7183462532299743) internal successors, (665), 395 states have internal predecessors, (665), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) 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-12 21:44:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:52,486 INFO L93 Difference]: Finished difference Result 993 states and 1649 transitions. [2024-10-12 21:44:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:44:52,489 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-12 21:44:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:52,507 INFO L225 Difference]: With dead ends: 993 [2024-10-12 21:44:52,508 INFO L226 Difference]: Without dead ends: 566 [2024-10-12 21:44:52,513 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-12 21:44:52,516 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 817 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:52,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1822 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:44:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-12 21:44:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 529. [2024-10-12 21:44:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 452 states have (on average 1.586283185840708) internal successors, (717), 459 states have internal predecessors, (717), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-10-12 21:44:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 824 transitions. [2024-10-12 21:44:52,613 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 824 transitions. Word has length 58 [2024-10-12 21:44:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:52,614 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 824 transitions. [2024-10-12 21:44:52,614 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-12 21:44:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 824 transitions. [2024-10-12 21:44:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:44:52,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:52,618 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-12 21:44:52,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:44:52,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2015051792, now seen corresponding path program 1 times [2024-10-12 21:44:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165213540] [2024-10-12 21:44:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:52,883 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-12 21:44:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165213540] [2024-10-12 21:44:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165213540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:44:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408231450] [2024-10-12 21:44:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:44:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:44:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:44:52,888 INFO L87 Difference]: Start difference. First operand 529 states and 824 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-12 21:44:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:54,390 INFO L93 Difference]: Finished difference Result 849 states and 1274 transitions. [2024-10-12 21:44:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:44:54,392 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-12 21:44:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:54,401 INFO L225 Difference]: With dead ends: 849 [2024-10-12 21:44:54,402 INFO L226 Difference]: Without dead ends: 687 [2024-10-12 21:44:54,403 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-12 21:44:54,405 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1349 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:54,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 2040 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:44:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-12 21:44:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 617. [2024-10-12 21:44:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 520 states have (on average 1.5634615384615385) internal successors, (813), 529 states have internal predecessors, (813), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-12 21:44:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 950 transitions. [2024-10-12 21:44:54,473 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 950 transitions. Word has length 58 [2024-10-12 21:44:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:54,473 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 950 transitions. [2024-10-12 21:44:54,474 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-12 21:44:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 950 transitions. [2024-10-12 21:44:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:44:54,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:54,479 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-12 21:44:54,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:44:54,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:54,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -351642802, now seen corresponding path program 1 times [2024-10-12 21:44:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:54,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320896518] [2024-10-12 21:44:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:54,668 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-12 21:44:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:54,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320896518] [2024-10-12 21:44:54,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320896518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:54,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:54,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:44:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541303203] [2024-10-12 21:44:54,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:44:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:44:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:44:54,671 INFO L87 Difference]: Start difference. First operand 617 states and 950 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-12 21:44:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:56,068 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2024-10-12 21:44:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:44:56,070 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-12 21:44:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:56,077 INFO L225 Difference]: With dead ends: 891 [2024-10-12 21:44:56,078 INFO L226 Difference]: Without dead ends: 647 [2024-10-12 21:44:56,079 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-12 21:44:56,080 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 612 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:56,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 2493 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:44:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-12 21:44:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 621. [2024-10-12 21:44:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 523 states have (on average 1.5564053537284894) internal successors, (814), 532 states have internal predecessors, (814), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2024-10-12 21:44:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 952 transitions. [2024-10-12 21:44:56,135 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 952 transitions. Word has length 58 [2024-10-12 21:44:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:56,135 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 952 transitions. [2024-10-12 21:44:56,136 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-12 21:44:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 952 transitions. [2024-10-12 21:44:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:44:56,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:56,138 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-12 21:44:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:44:56,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1699341196, now seen corresponding path program 1 times [2024-10-12 21:44:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871907773] [2024-10-12 21:44:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:56,324 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-12 21:44:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871907773] [2024-10-12 21:44:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871907773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:44:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606934250] [2024-10-12 21:44:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:44:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:44:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:44:56,331 INFO L87 Difference]: Start difference. First operand 621 states and 952 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-12 21:44:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:58,297 INFO L93 Difference]: Finished difference Result 1845 states and 2650 transitions. [2024-10-12 21:44:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:44:58,298 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-12 21:44:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:58,305 INFO L225 Difference]: With dead ends: 1845 [2024-10-12 21:44:58,306 INFO L226 Difference]: Without dead ends: 1579 [2024-10-12 21:44:58,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:44:58,309 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 3470 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:58,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 2271 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:44:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-10-12 21:44:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1456. [2024-10-12 21:44:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1172 states have (on average 1.439419795221843) internal successors, (1687), 1196 states have internal predecessors, (1687), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2024-10-12 21:44:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2027 transitions. [2024-10-12 21:44:58,432 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2027 transitions. Word has length 58 [2024-10-12 21:44:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:58,433 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2027 transitions. [2024-10-12 21:44:58,433 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-12 21:44:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2027 transitions. [2024-10-12 21:44:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:44:58,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:58,434 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-12 21:44:58,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:44:58,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:58,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash -773396516, now seen corresponding path program 1 times [2024-10-12 21:44:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371894709] [2024-10-12 21:44:58,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:58,559 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-12 21:44:58,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371894709] [2024-10-12 21:44:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371894709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:58,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:58,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:44:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962917103] [2024-10-12 21:44:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:44:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:44:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:44:58,562 INFO L87 Difference]: Start difference. First operand 1456 states and 2027 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-12 21:44:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:59,855 INFO L93 Difference]: Finished difference Result 2645 states and 3598 transitions. [2024-10-12 21:44:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:44:59,856 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-12 21:44:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:59,863 INFO L225 Difference]: With dead ends: 2645 [2024-10-12 21:44:59,864 INFO L226 Difference]: Without dead ends: 1550 [2024-10-12 21:44:59,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:59,867 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 920 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:59,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 2208 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:44:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-12 21:44:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1480. [2024-10-12 21:44:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1190 states have (on average 1.4260504201680673) internal successors, (1697), 1214 states have internal predecessors, (1697), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2024-10-12 21:44:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2043 transitions. [2024-10-12 21:44:59,955 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2043 transitions. Word has length 59 [2024-10-12 21:44:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:59,955 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2043 transitions. [2024-10-12 21:44:59,956 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-12 21:44:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2043 transitions. [2024-10-12 21:44:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:44:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:59,957 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-12 21:44:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:44:59,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1149831518, now seen corresponding path program 1 times [2024-10-12 21:44:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359493242] [2024-10-12 21:44:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:00,139 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-12 21:45:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:00,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359493242] [2024-10-12 21:45:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359493242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:45:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919914271] [2024-10-12 21:45:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:45:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:45:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:45:00,141 INFO L87 Difference]: Start difference. First operand 1480 states and 2043 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-12 21:45:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:01,286 INFO L93 Difference]: Finished difference Result 2630 states and 3485 transitions. [2024-10-12 21:45:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:45:01,287 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-12 21:45:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:01,296 INFO L225 Difference]: With dead ends: 2630 [2024-10-12 21:45:01,296 INFO L226 Difference]: Without dead ends: 1718 [2024-10-12 21:45:01,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:45:01,304 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 1365 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:01,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 1806 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:45:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2024-10-12 21:45:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1425. [2024-10-12 21:45:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1151 states have (on average 1.423979148566464) internal successors, (1639), 1170 states have internal predecessors, (1639), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2024-10-12 21:45:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1964 transitions. [2024-10-12 21:45:01,395 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1964 transitions. Word has length 59 [2024-10-12 21:45:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:01,396 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1964 transitions. [2024-10-12 21:45:01,399 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-12 21:45:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1964 transitions. [2024-10-12 21:45:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:45:01,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:01,400 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-12 21:45:01,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:45:01,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:01,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1368686236, now seen corresponding path program 1 times [2024-10-12 21:45:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:01,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93940273] [2024-10-12 21:45:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:01,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-12 21:45:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93940273] [2024-10-12 21:45:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93940273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826181653] [2024-10-12 21:45:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:01,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:01,575 INFO L87 Difference]: Start difference. First operand 1425 states and 1964 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-12 21:45:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:02,454 INFO L93 Difference]: Finished difference Result 3574 states and 4735 transitions. [2024-10-12 21:45:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:45:02,457 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-12 21:45:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:02,469 INFO L225 Difference]: With dead ends: 3574 [2024-10-12 21:45:02,469 INFO L226 Difference]: Without dead ends: 2511 [2024-10-12 21:45:02,472 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-12 21:45:02,473 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1677 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:02,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1219 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:45:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-10-12 21:45:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2395. [2024-10-12 21:45:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1878 states have (on average 1.351437699680511) internal successors, (2538), 1914 states have internal predecessors, (2538), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2024-10-12 21:45:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3173 transitions. [2024-10-12 21:45:02,642 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3173 transitions. Word has length 59 [2024-10-12 21:45:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:02,642 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3173 transitions. [2024-10-12 21:45:02,642 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-12 21:45:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3173 transitions. [2024-10-12 21:45:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:45:02,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:02,644 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-12 21:45:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:45:02,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 162092218, now seen corresponding path program 1 times [2024-10-12 21:45:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499742528] [2024-10-12 21:45:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:02,756 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-12 21:45:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499742528] [2024-10-12 21:45:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499742528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:45:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671398150] [2024-10-12 21:45:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:45:02,758 INFO L87 Difference]: Start difference. First operand 2395 states and 3173 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-12 21:45:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:03,562 INFO L93 Difference]: Finished difference Result 5447 states and 7054 transitions. [2024-10-12 21:45:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:45:03,562 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-12 21:45:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:03,581 INFO L225 Difference]: With dead ends: 5447 [2024-10-12 21:45:03,581 INFO L226 Difference]: Without dead ends: 3419 [2024-10-12 21:45:03,587 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-12 21:45:03,588 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1127 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:03,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1219 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:45:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-10-12 21:45:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3161. [2024-10-12 21:45:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2458 states have (on average 1.3283157038242475) internal successors, (3265), 2499 states have internal predecessors, (3265), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2024-10-12 21:45:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4106 transitions. [2024-10-12 21:45:03,922 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4106 transitions. Word has length 60 [2024-10-12 21:45:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:03,923 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4106 transitions. [2024-10-12 21:45:03,923 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-12 21:45:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4106 transitions. [2024-10-12 21:45:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:45:03,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:03,924 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-12 21:45:03,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:45:03,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash -337547975, now seen corresponding path program 1 times [2024-10-12 21:45:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087075760] [2024-10-12 21:45:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:04,004 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-12 21:45:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:04,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087075760] [2024-10-12 21:45:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087075760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:04,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:45:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842503117] [2024-10-12 21:45:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:45:04,006 INFO L87 Difference]: Start difference. First operand 3161 states and 4106 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-12 21:45:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:04,802 INFO L93 Difference]: Finished difference Result 6725 states and 8572 transitions. [2024-10-12 21:45:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:45:04,803 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-12 21:45:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:04,819 INFO L225 Difference]: With dead ends: 6725 [2024-10-12 21:45:04,819 INFO L226 Difference]: Without dead ends: 3929 [2024-10-12 21:45:04,825 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-12 21:45:04,826 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1643 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:04,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 988 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:45:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2024-10-12 21:45:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3665. [2024-10-12 21:45:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2848 states have (on average 1.3184691011235956) internal successors, (3755), 2893 states have internal predecessors, (3755), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2024-10-12 21:45:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4725 transitions. [2024-10-12 21:45:05,129 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4725 transitions. Word has length 66 [2024-10-12 21:45:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:05,130 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 4725 transitions. [2024-10-12 21:45:05,130 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-12 21:45:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4725 transitions. [2024-10-12 21:45:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 21:45:05,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:05,133 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-12 21:45:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:45:05,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1903944634, now seen corresponding path program 1 times [2024-10-12 21:45:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778861732] [2024-10-12 21:45:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:05,261 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-12 21:45:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778861732] [2024-10-12 21:45:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778861732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:05,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462010305] [2024-10-12 21:45:05,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:05,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:05,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:05,264 INFO L87 Difference]: Start difference. First operand 3665 states and 4725 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-12 21:45:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:06,330 INFO L93 Difference]: Finished difference Result 4673 states and 5942 transitions. [2024-10-12 21:45:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:45:06,331 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-12 21:45:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:06,352 INFO L225 Difference]: With dead ends: 4673 [2024-10-12 21:45:06,352 INFO L226 Difference]: Without dead ends: 4670 [2024-10-12 21:45:06,355 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-12 21:45:06,356 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1965 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:06,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 1252 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:45:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2024-10-12 21:45:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4085. [2024-10-12 21:45:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 3161 states have (on average 1.3062322049984183) internal successors, (4129), 3209 states have internal predecessors, (4129), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2024-10-12 21:45:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5226 transitions. [2024-10-12 21:45:06,710 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5226 transitions. Word has length 67 [2024-10-12 21:45:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:06,711 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 5226 transitions. [2024-10-12 21:45:06,711 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-12 21:45:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5226 transitions. [2024-10-12 21:45:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:45:06,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:06,712 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-12 21:45:06,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:45:06,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:06,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:06,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1108732509, now seen corresponding path program 1 times [2024-10-12 21:45:06,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:06,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277345641] [2024-10-12 21:45:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:06,865 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-12 21:45:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277345641] [2024-10-12 21:45:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277345641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:45:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714583942] [2024-10-12 21:45:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:45:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:45:06,869 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-12 21:45:06,870 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-12 21:45:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:07,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:45:07,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:45:07,268 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-12 21:45:07,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:45:07,371 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-12 21:45:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714583942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:45:07,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:45:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-12 21:45:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705532160] [2024-10-12 21:45:07,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:45:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:45:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:45:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:45:07,374 INFO L87 Difference]: Start difference. First operand 4085 states and 5226 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-12 21:45:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:09,756 INFO L93 Difference]: Finished difference Result 8057 states and 10089 transitions. [2024-10-12 21:45:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 21:45:09,756 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-12 21:45:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:09,793 INFO L225 Difference]: With dead ends: 8057 [2024-10-12 21:45:09,793 INFO L226 Difference]: Without dead ends: 8054 [2024-10-12 21:45:09,797 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-12 21:45:09,797 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1686 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:09,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2489 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:45:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2024-10-12 21:45:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 7202. [2024-10-12 21:45:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5536 states have (on average 1.2846820809248556) internal successors, (7112), 5619 states have internal predecessors, (7112), 822 states have call successors, (822), 694 states have call predecessors, (822), 842 states have return successors, (1135), 891 states have call predecessors, (1135), 819 states have call successors, (1135) [2024-10-12 21:45:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9069 transitions. [2024-10-12 21:45:10,404 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9069 transitions. Word has length 68 [2024-10-12 21:45:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:10,405 INFO L471 AbstractCegarLoop]: Abstraction has 7202 states and 9069 transitions. [2024-10-12 21:45:10,405 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-12 21:45:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9069 transitions. [2024-10-12 21:45:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:45:10,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:10,407 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-12 21:45:10,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:45:10,611 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-12 21:45:10,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 681300090, now seen corresponding path program 2 times [2024-10-12 21:45:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267453014] [2024-10-12 21:45:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:10,722 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-12 21:45:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267453014] [2024-10-12 21:45:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267453014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:45:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906773908] [2024-10-12 21:45:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:10,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:10,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:45:10,729 INFO L87 Difference]: Start difference. First operand 7202 states and 9069 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-12 21:45:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:11,563 INFO L93 Difference]: Finished difference Result 9590 states and 12072 transitions. [2024-10-12 21:45:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:45:11,566 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-12 21:45:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:11,594 INFO L225 Difference]: With dead ends: 9590 [2024-10-12 21:45:11,594 INFO L226 Difference]: Without dead ends: 3952 [2024-10-12 21:45:11,611 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-12 21:45:11,612 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1560 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:11,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 1019 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:45:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-10-12 21:45:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3016. [2024-10-12 21:45:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 2356 states have (on average 1.3009337860780985) internal successors, (3065), 2385 states have internal predecessors, (3065), 341 states have call successors, (341), 276 states have call predecessors, (341), 317 states have return successors, (434), 357 states have call predecessors, (434), 338 states have call successors, (434) [2024-10-12 21:45:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3840 transitions. [2024-10-12 21:45:11,928 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3840 transitions. Word has length 71 [2024-10-12 21:45:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 3016 states and 3840 transitions. [2024-10-12 21:45:11,930 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-12 21:45:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3840 transitions. [2024-10-12 21:45:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:45:11,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:11,932 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-12 21:45:11,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:45:11,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash 593941346, now seen corresponding path program 1 times [2024-10-12 21:45:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808519355] [2024-10-12 21:45:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:45:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:12,055 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-12 21:45:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808519355] [2024-10-12 21:45:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808519355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:45:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670538486] [2024-10-12 21:45:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:45:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:45:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:45:12,058 INFO L87 Difference]: Start difference. First operand 3016 states and 3840 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-12 21:45:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:13,703 INFO L93 Difference]: Finished difference Result 8334 states and 10371 transitions. [2024-10-12 21:45:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 21:45:13,703 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-12 21:45:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:13,724 INFO L225 Difference]: With dead ends: 8334 [2024-10-12 21:45:13,724 INFO L226 Difference]: Without dead ends: 4944 [2024-10-12 21:45:13,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-12 21:45:13,734 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1064 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:13,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1905 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:45:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-10-12 21:45:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4684. [2024-10-12 21:45:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 3589 states have (on average 1.2585678461967122) internal successors, (4517), 3655 states have internal predecessors, (4517), 541 states have call successors, (541), 448 states have call predecessors, (541), 552 states have return successors, (784), 583 states have call predecessors, (784), 538 states have call successors, (784) [2024-10-12 21:45:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 5842 transitions. [2024-10-12 21:45:14,279 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 5842 transitions. Word has length 76 [2024-10-12 21:45:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:14,279 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 5842 transitions. [2024-10-12 21:45:14,279 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-12 21:45:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 5842 transitions. [2024-10-12 21:45:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:45:14,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:14,283 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-12 21:45:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:45:14,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1577653767, now seen corresponding path program 1 times [2024-10-12 21:45:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847002313] [2024-10-12 21:45:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:45:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:14,417 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-12 21:45:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847002313] [2024-10-12 21:45:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847002313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:45:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369590392] [2024-10-12 21:45:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:14,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:45:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:45:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:45:14,419 INFO L87 Difference]: Start difference. First operand 4684 states and 5842 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-12 21:45:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:16,089 INFO L93 Difference]: Finished difference Result 7774 states and 9590 transitions. [2024-10-12 21:45:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 21:45:16,090 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-12 21:45:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:16,108 INFO L225 Difference]: With dead ends: 7774 [2024-10-12 21:45:16,108 INFO L226 Difference]: Without dead ends: 3931 [2024-10-12 21:45:16,117 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-12 21:45:16,118 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 2254 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:16,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 1897 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:45:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2024-10-12 21:45:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3527. [2024-10-12 21:45:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 2698 states have (on average 1.250555967383247) internal successors, (3374), 2752 states have internal predecessors, (3374), 406 states have call successors, (406), 330 states have call predecessors, (406), 421 states have return successors, (553), 447 states have call predecessors, (553), 403 states have call successors, (553) [2024-10-12 21:45:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 4333 transitions. [2024-10-12 21:45:16,545 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 4333 transitions. Word has length 86 [2024-10-12 21:45:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:16,545 INFO L471 AbstractCegarLoop]: Abstraction has 3527 states and 4333 transitions. [2024-10-12 21:45:16,546 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-12 21:45:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 4333 transitions. [2024-10-12 21:45:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:45:16,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:16,549 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-12 21:45:16,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:45:16,550 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:16,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1136699246, now seen corresponding path program 1 times [2024-10-12 21:45:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017569019] [2024-10-12 21:45:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:45:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:45:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:45:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 21:45:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 21:45:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:45:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 21:45:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,725 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-12 21:45:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017569019] [2024-10-12 21:45:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017569019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:45:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836340537] [2024-10-12 21:45:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:45:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:45:16,729 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-12 21:45:16,730 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-12 21:45:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:16,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:45:16,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:45:16,912 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-12 21:45:16,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:45:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836340537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:45:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-12 21:45:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058288515] [2024-10-12 21:45:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:16,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:45:16,917 INFO L87 Difference]: Start difference. First operand 3527 states and 4333 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-12 21:45:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:17,166 INFO L93 Difference]: Finished difference Result 5118 states and 6241 transitions. [2024-10-12 21:45:17,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:45:17,166 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-12 21:45:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:17,176 INFO L225 Difference]: With dead ends: 5118 [2024-10-12 21:45:17,176 INFO L226 Difference]: Without dead ends: 1958 [2024-10-12 21:45:17,182 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-12 21:45:17,183 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 0 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:17,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3208 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:45:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-10-12 21:45:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1958. [2024-10-12 21:45:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1575 states have (on average 1.2831746031746032) internal successors, (2021), 1592 states have internal predecessors, (2021), 195 states have call successors, (195), 144 states have call predecessors, (195), 186 states have return successors, (260), 222 states have call predecessors, (260), 192 states have call successors, (260) [2024-10-12 21:45:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2476 transitions. [2024-10-12 21:45:17,342 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2476 transitions. Word has length 131 [2024-10-12 21:45:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:17,343 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2476 transitions. [2024-10-12 21:45:17,343 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-12 21:45:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2476 transitions. [2024-10-12 21:45:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 21:45:17,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:17,345 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:17,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:45:17,546 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-12 21:45:17,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash -981467806, now seen corresponding path program 1 times [2024-10-12 21:45:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:17,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059948320] [2024-10-12 21:45:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:45:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 21:45:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:45:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:45:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 21:45:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:45:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 21:45:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-12 21:45:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059948320] [2024-10-12 21:45:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059948320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:45:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030434068] [2024-10-12 21:45:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:17,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:45:17,649 INFO L87 Difference]: Start difference. First operand 1958 states and 2476 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 21:45:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:18,495 INFO L93 Difference]: Finished difference Result 2006 states and 2526 transitions. [2024-10-12 21:45:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-12 21:45:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:18,502 INFO L225 Difference]: With dead ends: 2006 [2024-10-12 21:45:18,502 INFO L226 Difference]: Without dead ends: 1666 [2024-10-12 21:45:18,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:45:18,504 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 715 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:18,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1448 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:45:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-10-12 21:45:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1621. [2024-10-12 21:45:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1322 states have (on average 1.3078668683812404) internal successors, (1729), 1336 states have internal predecessors, (1729), 154 states have call successors, (154), 109 states have call predecessors, (154), 143 states have return successors, (205), 176 states have call predecessors, (205), 151 states have call successors, (205) [2024-10-12 21:45:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2088 transitions. [2024-10-12 21:45:18,724 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2088 transitions. Word has length 133 [2024-10-12 21:45:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:18,724 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 2088 transitions. [2024-10-12 21:45:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 21:45:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2088 transitions. [2024-10-12 21:45:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 21:45:18,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:18,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:18,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:45:18,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:18,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash -686051311, now seen corresponding path program 1 times [2024-10-12 21:45:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866646544] [2024-10-12 21:45:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:45:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 21:45:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 21:45:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:45:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:45:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 21:45:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 21:45:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 21:45:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866646544] [2024-10-12 21:45:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866646544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500683875] [2024-10-12 21:45:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:18,880 INFO L87 Difference]: Start difference. First operand 1621 states and 2088 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 21:45:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:20,048 INFO L93 Difference]: Finished difference Result 2772 states and 3472 transitions. [2024-10-12 21:45:20,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:45:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-12 21:45:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:20,057 INFO L225 Difference]: With dead ends: 2772 [2024-10-12 21:45:20,057 INFO L226 Difference]: Without dead ends: 1601 [2024-10-12 21:45:20,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:20,060 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 949 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:20,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1581 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:45:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-10-12 21:45:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1520. [2024-10-12 21:45:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1245 states have (on average 1.318875502008032) internal successors, (1642), 1259 states have internal predecessors, (1642), 142 states have call successors, (142), 99 states have call predecessors, (142), 131 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2024-10-12 21:45:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1971 transitions. [2024-10-12 21:45:20,209 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1971 transitions. Word has length 145 [2024-10-12 21:45:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:20,212 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1971 transitions. [2024-10-12 21:45:20,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 21:45:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1971 transitions. [2024-10-12 21:45:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-12 21:45:20,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:20,216 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:45:20,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:45:20,216 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:20,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1881254448, now seen corresponding path program 1 times [2024-10-12 21:45:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506723956] [2024-10-12 21:45:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:45:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 21:45:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 21:45:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 21:45:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 21:45:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:45:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 21:45:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 21:45:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:20,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506723956] [2024-10-12 21:45:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506723956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:45:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134383901] [2024-10-12 21:45:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:20,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:45:20,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:45:20,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:45:20,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:45:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:20,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 21:45:20,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:45:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 21:45:20,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:45:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 21:45:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134383901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:45:21,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:45:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-12 21:45:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215957593] [2024-10-12 21:45:21,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:45:21,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 21:45:21,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:21,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 21:45:21,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-12 21:45:21,152 INFO L87 Difference]: Start difference. First operand 1520 states and 1971 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-12 21:45:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:22,703 INFO L93 Difference]: Finished difference Result 3111 states and 3965 transitions. [2024-10-12 21:45:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 21:45:22,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-12 21:45:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:22,713 INFO L225 Difference]: With dead ends: 3111 [2024-10-12 21:45:22,713 INFO L226 Difference]: Without dead ends: 1888 [2024-10-12 21:45:22,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-12 21:45:22,717 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 2349 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:22,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2381 Valid, 2518 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:45:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-10-12 21:45:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1780. [2024-10-12 21:45:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.2776223776223776) internal successors, (1827), 1445 states have internal predecessors, (1827), 182 states have call successors, (182), 137 states have call predecessors, (182), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-12 21:45:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2265 transitions. [2024-10-12 21:45:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2265 transitions. Word has length 147 [2024-10-12 21:45:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:22,881 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2265 transitions. [2024-10-12 21:45:22,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-12 21:45:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2265 transitions. [2024-10-12 21:45:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:22,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:22,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:22,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 21:45:23,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 21:45:23,085 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1081367391, now seen corresponding path program 1 times [2024-10-12 21:45:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:23,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103173459] [2024-10-12 21:45:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:23,275 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-12 21:45:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103173459] [2024-10-12 21:45:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103173459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:45:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099464910] [2024-10-12 21:45:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:23,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:45:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:45:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:45:23,279 INFO L87 Difference]: Start difference. First operand 1780 states and 2265 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:45:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:25,309 INFO L93 Difference]: Finished difference Result 2256 states and 3062 transitions. [2024-10-12 21:45:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:25,315 INFO L225 Difference]: With dead ends: 2256 [2024-10-12 21:45:25,315 INFO L226 Difference]: Without dead ends: 1910 [2024-10-12 21:45:25,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:45:25,316 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1082 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:25,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 855 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:45:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-10-12 21:45:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1780. [2024-10-12 21:45:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.2769230769230768) internal successors, (1826), 1445 states have internal predecessors, (1826), 182 states have call successors, (182), 137 states have call predecessors, (182), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-12 21:45:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2264 transitions. [2024-10-12 21:45:25,605 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2264 transitions. Word has length 162 [2024-10-12 21:45:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:25,606 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2264 transitions. [2024-10-12 21:45:25,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:45:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2264 transitions. [2024-10-12 21:45:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:25,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:25,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:45:25,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 323824287, now seen corresponding path program 1 times [2024-10-12 21:45:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081482190] [2024-10-12 21:45:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:25,788 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-12 21:45:25,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081482190] [2024-10-12 21:45:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081482190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:45:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694172318] [2024-10-12 21:45:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:25,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:45:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:45:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:45:25,791 INFO L87 Difference]: Start difference. First operand 1780 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:45:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:27,839 INFO L93 Difference]: Finished difference Result 2248 states and 3045 transitions. [2024-10-12 21:45:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:27,846 INFO L225 Difference]: With dead ends: 2248 [2024-10-12 21:45:27,846 INFO L226 Difference]: Without dead ends: 1910 [2024-10-12 21:45:27,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:45:27,848 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1073 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:27,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 853 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:45:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-10-12 21:45:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1780. [2024-10-12 21:45:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.2762237762237763) internal successors, (1825), 1445 states have internal predecessors, (1825), 182 states have call successors, (182), 137 states have call predecessors, (182), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-12 21:45:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2263 transitions. [2024-10-12 21:45:28,163 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2263 transitions. Word has length 162 [2024-10-12 21:45:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:28,163 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2263 transitions. [2024-10-12 21:45:28,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:45:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2263 transitions. [2024-10-12 21:45:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:28,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:28,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:45:28,166 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:28,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1573155171, now seen corresponding path program 1 times [2024-10-12 21:45:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:28,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91201161] [2024-10-12 21:45:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:28,432 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-12 21:45:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:28,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91201161] [2024-10-12 21:45:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91201161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:45:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597218633] [2024-10-12 21:45:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:28,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:45:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:45:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:45:28,434 INFO L87 Difference]: Start difference. First operand 1780 states and 2263 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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-12 21:45:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:31,284 INFO L93 Difference]: Finished difference Result 2729 states and 3853 transitions. [2024-10-12 21:45:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:45:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:31,292 INFO L225 Difference]: With dead ends: 2729 [2024-10-12 21:45:31,292 INFO L226 Difference]: Without dead ends: 2394 [2024-10-12 21:45:31,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:31,294 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1697 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:31,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 1280 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:45:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-10-12 21:45:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2133. [2024-10-12 21:45:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1755 states have (on average 1.3464387464387464) internal successors, (2363), 1771 states have internal predecessors, (2363), 203 states have call successors, (203), 143 states have call predecessors, (203), 173 states have return successors, (280), 219 states have call predecessors, (280), 200 states have call successors, (280) [2024-10-12 21:45:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2846 transitions. [2024-10-12 21:45:31,686 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2846 transitions. Word has length 162 [2024-10-12 21:45:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:31,687 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 2846 transitions. [2024-10-12 21:45:31,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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-12 21:45:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2846 transitions. [2024-10-12 21:45:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:31,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:31,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:31,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:45:31,689 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:31,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash 516443741, now seen corresponding path program 1 times [2024-10-12 21:45:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:31,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357610486] [2024-10-12 21:45:31,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:31,952 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-12 21:45:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357610486] [2024-10-12 21:45:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357610486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:31,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037642514] [2024-10-12 21:45:31,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:31,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:31,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:31,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:31,956 INFO L87 Difference]: Start difference. First operand 2133 states and 2846 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:35,789 INFO L93 Difference]: Finished difference Result 3586 states and 5285 transitions. [2024-10-12 21:45:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:45:35,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:35,804 INFO L225 Difference]: With dead ends: 3586 [2024-10-12 21:45:35,805 INFO L226 Difference]: Without dead ends: 2898 [2024-10-12 21:45:35,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:45:35,809 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1738 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 3984 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:35,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 2323 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3984 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:45:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2024-10-12 21:45:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2460. [2024-10-12 21:45:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2054 states have (on average 1.387049659201558) internal successors, (2849), 2071 states have internal predecessors, (2849), 224 states have call successors, (224), 149 states have call predecessors, (224), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-12 21:45:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3376 transitions. [2024-10-12 21:45:36,260 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3376 transitions. Word has length 162 [2024-10-12 21:45:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:36,261 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3376 transitions. [2024-10-12 21:45:36,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3376 transitions. [2024-10-12 21:45:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:36,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:36,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:36,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:45:36,264 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1271426081, now seen corresponding path program 1 times [2024-10-12 21:45:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043830196] [2024-10-12 21:45:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:36,520 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-12 21:45:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043830196] [2024-10-12 21:45:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043830196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988415994] [2024-10-12 21:45:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:36,522 INFO L87 Difference]: Start difference. First operand 2460 states and 3376 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:38,604 INFO L93 Difference]: Finished difference Result 3929 states and 5853 transitions. [2024-10-12 21:45:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:38,615 INFO L225 Difference]: With dead ends: 3929 [2024-10-12 21:45:38,615 INFO L226 Difference]: Without dead ends: 2914 [2024-10-12 21:45:38,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:38,620 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1490 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:38,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1083 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:45:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-10-12 21:45:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2460. [2024-10-12 21:45:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2054 states have (on average 1.385589094449854) internal successors, (2846), 2071 states have internal predecessors, (2846), 224 states have call successors, (224), 149 states have call predecessors, (224), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-12 21:45:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3373 transitions. [2024-10-12 21:45:39,051 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3373 transitions. Word has length 162 [2024-10-12 21:45:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3373 transitions. [2024-10-12 21:45:39,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3373 transitions. [2024-10-12 21:45:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:39,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:39,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:39,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:45:39,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:39,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash 887658013, now seen corresponding path program 1 times [2024-10-12 21:45:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:39,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33410516] [2024-10-12 21:45:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:39,278 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-12 21:45:39,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:39,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33410516] [2024-10-12 21:45:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33410516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:39,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447880069] [2024-10-12 21:45:39,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:39,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:39,281 INFO L87 Difference]: Start difference. First operand 2460 states and 3373 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:41,458 INFO L93 Difference]: Finished difference Result 3925 states and 5836 transitions. [2024-10-12 21:45:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:41,468 INFO L225 Difference]: With dead ends: 3925 [2024-10-12 21:45:41,469 INFO L226 Difference]: Without dead ends: 2910 [2024-10-12 21:45:41,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:41,477 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1288 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:41,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1297 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:45:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2024-10-12 21:45:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2460. [2024-10-12 21:45:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2054 states have (on average 1.38412852969815) internal successors, (2843), 2071 states have internal predecessors, (2843), 224 states have call successors, (224), 149 states have call predecessors, (224), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-12 21:45:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3370 transitions. [2024-10-12 21:45:41,795 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3370 transitions. Word has length 162 [2024-10-12 21:45:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:41,796 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3370 transitions. [2024-10-12 21:45:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3370 transitions. [2024-10-12 21:45:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:41,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:41,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:41,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:45:41,799 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:41,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash 957305887, now seen corresponding path program 1 times [2024-10-12 21:45:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762512185] [2024-10-12 21:45:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:42,015 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-12 21:45:42,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762512185] [2024-10-12 21:45:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762512185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701018478] [2024-10-12 21:45:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:42,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:42,017 INFO L87 Difference]: Start difference. First operand 2460 states and 3370 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:44,139 INFO L93 Difference]: Finished difference Result 3921 states and 5819 transitions. [2024-10-12 21:45:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:44,150 INFO L225 Difference]: With dead ends: 3921 [2024-10-12 21:45:44,150 INFO L226 Difference]: Without dead ends: 2906 [2024-10-12 21:45:44,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:44,153 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1368 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:44,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1296 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:45:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2024-10-12 21:45:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2460. [2024-10-12 21:45:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2054 states have (on average 1.382667964946446) internal successors, (2840), 2071 states have internal predecessors, (2840), 224 states have call successors, (224), 149 states have call predecessors, (224), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-12 21:45:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3367 transitions. [2024-10-12 21:45:44,557 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3367 transitions. Word has length 162 [2024-10-12 21:45:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:44,558 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3367 transitions. [2024-10-12 21:45:44,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3367 transitions. [2024-10-12 21:45:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:44,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:44,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:44,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:45:44,561 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:44,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1375194589, now seen corresponding path program 1 times [2024-10-12 21:45:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:44,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216041531] [2024-10-12 21:45:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:44,809 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-12 21:45:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:44,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216041531] [2024-10-12 21:45:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216041531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:44,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100310124] [2024-10-12 21:45:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:44,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:44,811 INFO L87 Difference]: Start difference. First operand 2460 states and 3367 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:48,635 INFO L93 Difference]: Finished difference Result 4828 states and 7297 transitions. [2024-10-12 21:45:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:45:48,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:48,649 INFO L225 Difference]: With dead ends: 4828 [2024-10-12 21:45:48,650 INFO L226 Difference]: Without dead ends: 3813 [2024-10-12 21:45:48,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:45:48,654 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1712 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 3986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:48,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 2321 Invalid, 3986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:45:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2024-10-12 21:45:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3126. [2024-10-12 21:45:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2664 states have (on average 1.43506006006006) internal successors, (3823), 2683 states have internal predecessors, (3823), 266 states have call successors, (266), 161 states have call predecessors, (266), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-12 21:45:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4442 transitions. [2024-10-12 21:45:49,089 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4442 transitions. Word has length 162 [2024-10-12 21:45:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:49,089 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 4442 transitions. [2024-10-12 21:45:49,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4442 transitions. [2024-10-12 21:45:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:49,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:49,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:49,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:45:49,092 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:49,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1520819105, now seen corresponding path program 1 times [2024-10-12 21:45:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:49,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116796663] [2024-10-12 21:45:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:45:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116796663] [2024-10-12 21:45:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116796663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:49,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258499949] [2024-10-12 21:45:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:49,324 INFO L87 Difference]: Start difference. First operand 3126 states and 4442 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:51,167 INFO L93 Difference]: Finished difference Result 5479 states and 8358 transitions. [2024-10-12 21:45:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:45:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:51,181 INFO L225 Difference]: With dead ends: 5479 [2024-10-12 21:45:51,181 INFO L226 Difference]: Without dead ends: 3798 [2024-10-12 21:45:51,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:45:51,186 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1485 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:51,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1083 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:45:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2024-10-12 21:45:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3126. [2024-10-12 21:45:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2664 states have (on average 1.4331831831831832) internal successors, (3818), 2683 states have internal predecessors, (3818), 266 states have call successors, (266), 161 states have call predecessors, (266), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-12 21:45:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4437 transitions. [2024-10-12 21:45:51,581 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4437 transitions. Word has length 162 [2024-10-12 21:45:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 4437 transitions. [2024-10-12 21:45:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4437 transitions. [2024-10-12 21:45:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:51,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:51,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:45:51,583 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1156707741, now seen corresponding path program 1 times [2024-10-12 21:45:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786222721] [2024-10-12 21:45:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:51,813 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-12 21:45:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786222721] [2024-10-12 21:45:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786222721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346372392] [2024-10-12 21:45:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:51,816 INFO L87 Difference]: Start difference. First operand 3126 states and 4437 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:55,700 INFO L93 Difference]: Finished difference Result 7236 states and 11208 transitions. [2024-10-12 21:45:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:45:55,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:45:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:55,714 INFO L225 Difference]: With dead ends: 7236 [2024-10-12 21:45:55,715 INFO L226 Difference]: Without dead ends: 5555 [2024-10-12 21:45:55,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:45:55,719 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1710 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:55,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2321 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3841 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:45:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2024-10-12 21:45:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 4460. [2024-10-12 21:45:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 3886 states have (on average 1.4868759650025734) internal successors, (5778), 3909 states have internal predecessors, (5778), 350 states have call successors, (350), 185 states have call predecessors, (350), 222 states have return successors, (459), 373 states have call predecessors, (459), 347 states have call successors, (459) [2024-10-12 21:45:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 6587 transitions. [2024-10-12 21:45:56,316 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 6587 transitions. Word has length 162 [2024-10-12 21:45:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:56,316 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 6587 transitions. [2024-10-12 21:45:56,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:45:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 6587 transitions. [2024-10-12 21:45:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:45:56,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:56,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:45:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 21:45:56,320 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1520174239, now seen corresponding path program 1 times [2024-10-12 21:45:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451252039] [2024-10-12 21:45:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:45:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:45:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:45:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:45:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:56,550 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-12 21:45:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451252039] [2024-10-12 21:45:56,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451252039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:56,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:56,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:45:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870494492] [2024-10-12 21:45:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:56,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:45:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:45:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:45:56,552 INFO L87 Difference]: Start difference. First operand 4460 states and 6587 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:46:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:00,529 INFO L93 Difference]: Finished difference Result 12050 states and 19068 transitions. [2024-10-12 21:46:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:46:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:00,559 INFO L225 Difference]: With dead ends: 12050 [2024-10-12 21:46:00,559 INFO L226 Difference]: Without dead ends: 9035 [2024-10-12 21:46:00,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:00,570 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1705 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 3814 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 3916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:00,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 2321 Invalid, 3916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3814 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:46:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states.