./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.04.cil-2.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.04.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:43:22,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:43:23,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:43:23,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:43:23,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:43:23,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:43:23,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:43:23,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:43:23,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:43:23,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:43:23,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:43:23,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:43:23,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:43:23,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:43:23,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:43:23,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:43:23,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:43:23,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:43:23,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:43:23,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:43:23,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:43:23,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:43:23,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:43:23,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:43:23,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:43:23,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:43:23,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:43:23,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:43:23,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:43:23,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:43:23,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:43:23,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:43:23,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:43:23,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:43:23,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:43:23,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:43:23,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:43:23,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:43:23,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:43:23,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:43:23,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:43:23,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:43:23,087 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 -> a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 [2024-10-12 21:43:23,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:43:23,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:43:23,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:43:23,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:43:23,371 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:43:23,372 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.04.cil-2.c [2024-10-12 21:43:24,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:43:24,955 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:43:24,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2024-10-12 21:43:24,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6e8e2a6/2d9ecc419e0040628f78cfce2c45043a/FLAG4b85e5fe0 [2024-10-12 21:43:25,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6e8e2a6/2d9ecc419e0040628f78cfce2c45043a [2024-10-12 21:43:25,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:43:25,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:43:25,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:43:25,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:43:25,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:43:25,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b92e112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25, skipping insertion in model container [2024-10-12 21:43:25,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:43:25,557 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.04.cil-2.c[914,927] [2024-10-12 21:43:25,604 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.04.cil-2.c[7115,7128] [2024-10-12 21:43:25,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:43:25,669 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:43:25,680 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.04.cil-2.c[914,927] [2024-10-12 21:43:25,698 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.04.cil-2.c[7115,7128] [2024-10-12 21:43:25,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:43:25,761 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:43:25,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25 WrapperNode [2024-10-12 21:43:25,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:43:25,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:43:25,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:43:25,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:43:25,768 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:43:25" (1/1) ... [2024-10-12 21:43:25,779 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:43:25" (1/1) ... [2024-10-12 21:43:25,816 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 594 [2024-10-12 21:43:25,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:43:25,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:43:25,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:43:25,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:43:25,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,857 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:43:25,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:43:25,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:43:25,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:43:25,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:43:25,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (1/1) ... [2024-10-12 21:43:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:43:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:43:25,938 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:43:25,945 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:43:25,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:43:25,993 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:43:25,993 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:43:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:43:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:43:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:43:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:43:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:43:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:43:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:43:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:43:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:43:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:43:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:43:25,997 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:43:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:43:25,997 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:43:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:43:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:43:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:43:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:43:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:43:25,999 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:43:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:43:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:43:26,000 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:43:26,000 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:43:26,000 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:43:26,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:43:26,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:43:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:43:26,001 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:43:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:43:26,001 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:43:26,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:43:26,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:43:26,727 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-12 21:43:26,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:43:26,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:43:26,790 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-12 21:43:26,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:43:26 BoogieIcfgContainer [2024-10-12 21:43:26,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:43:26,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:43:26,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:43:26,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:43:26,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:43:25" (1/3) ... [2024-10-12 21:43:26,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c2b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:43:26, skipping insertion in model container [2024-10-12 21:43:26,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:25" (2/3) ... [2024-10-12 21:43:26,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c2b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:43:26, skipping insertion in model container [2024-10-12 21:43:26,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:43:26" (3/3) ... [2024-10-12 21:43:26,797 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2024-10-12 21:43:26,811 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:43:26,812 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:43:26,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:43:26,881 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;@56c5cc7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:43:26,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:43:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 211 states have (on average 1.6729857819905214) internal successors, (353), 219 states have internal predecessors, (353), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 21:43:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:26,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:26,898 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:43:26,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1817163777, now seen corresponding path program 1 times [2024-10-12 21:43:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:26,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507260127] [2024-10-12 21:43:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:27,504 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:43:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507260127] [2024-10-12 21:43:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507260127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424639102] [2024-10-12 21:43:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:27,544 INFO L87 Difference]: Start difference. First operand has 263 states, 211 states have (on average 1.6729857819905214) internal successors, (353), 219 states have internal predecessors, (353), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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:43:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:28,899 INFO L93 Difference]: Finished difference Result 662 states and 1053 transitions. [2024-10-12 21:43:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:43:28,902 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:43:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:28,920 INFO L225 Difference]: With dead ends: 662 [2024-10-12 21:43:28,921 INFO L226 Difference]: Without dead ends: 411 [2024-10-12 21:43:28,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:43:28,932 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 761 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:28,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1284 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:43:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-12 21:43:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 349. [2024-10-12 21:43:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 279 states have (on average 1.5340501792114696) internal successors, (428), 287 states have internal predecessors, (428), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2024-10-12 21:43:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 525 transitions. [2024-10-12 21:43:29,039 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 525 transitions. Word has length 58 [2024-10-12 21:43:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:29,040 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 525 transitions. [2024-10-12 21:43:29,040 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:43:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 525 transitions. [2024-10-12 21:43:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:29,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:29,045 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:43:29,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:43:29,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -549530817, now seen corresponding path program 1 times [2024-10-12 21:43:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940380604] [2024-10-12 21:43:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:29,230 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:43:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940380604] [2024-10-12 21:43:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940380604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:43:29,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775772550] [2024-10-12 21:43:29,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:29,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:43:29,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:43:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:43:29,237 INFO L87 Difference]: Start difference. First operand 349 states and 525 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:43:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:30,156 INFO L93 Difference]: Finished difference Result 539 states and 797 transitions. [2024-10-12 21:43:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:30,158 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:43:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:30,162 INFO L225 Difference]: With dead ends: 539 [2024-10-12 21:43:30,164 INFO L226 Difference]: Without dead ends: 373 [2024-10-12 21:43:30,166 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:43:30,167 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 306 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:30,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1421 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:43:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-12 21:43:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2024-10-12 21:43:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 285 states have (on average 1.5228070175438597) internal successors, (434), 293 states have internal predecessors, (434), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2024-10-12 21:43:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 533 transitions. [2024-10-12 21:43:30,207 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 533 transitions. Word has length 58 [2024-10-12 21:43:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 533 transitions. [2024-10-12 21:43:30,207 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:43:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 533 transitions. [2024-10-12 21:43:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:30,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:30,213 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:43:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:43:30,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1501453181, now seen corresponding path program 1 times [2024-10-12 21:43:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859157390] [2024-10-12 21:43:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:30,373 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:43:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859157390] [2024-10-12 21:43:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859157390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:43:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120522113] [2024-10-12 21:43:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:43:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:43:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:43:30,376 INFO L87 Difference]: Start difference. First operand 357 states and 533 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:43:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:31,278 INFO L93 Difference]: Finished difference Result 559 states and 821 transitions. [2024-10-12 21:43:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:43:31,279 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:43:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:31,282 INFO L225 Difference]: With dead ends: 559 [2024-10-12 21:43:31,284 INFO L226 Difference]: Without dead ends: 385 [2024-10-12 21:43:31,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:43:31,286 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 303 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:31,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1421 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-12 21:43:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 365. [2024-10-12 21:43:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 291 states have (on average 1.5120274914089347) internal successors, (440), 299 states have internal predecessors, (440), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2024-10-12 21:43:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 541 transitions. [2024-10-12 21:43:31,317 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 541 transitions. Word has length 58 [2024-10-12 21:43:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:31,318 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 541 transitions. [2024-10-12 21:43:31,319 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:43:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 541 transitions. [2024-10-12 21:43:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:31,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:31,324 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:43:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:43:31,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1563492795, now seen corresponding path program 1 times [2024-10-12 21:43:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486727133] [2024-10-12 21:43:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:31,496 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:43:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486727133] [2024-10-12 21:43:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486727133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:31,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724417812] [2024-10-12 21:43:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:31,500 INFO L87 Difference]: Start difference. First operand 365 states and 541 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:43:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:32,364 INFO L93 Difference]: Finished difference Result 683 states and 992 transitions. [2024-10-12 21:43:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:43:32,365 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:43:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:32,371 INFO L225 Difference]: With dead ends: 683 [2024-10-12 21:43:32,373 INFO L226 Difference]: Without dead ends: 500 [2024-10-12 21:43:32,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:43:32,376 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 706 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:32,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1007 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-12 21:43:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 449. [2024-10-12 21:43:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 356 states have (on average 1.4803370786516854) internal successors, (527), 365 states have internal predecessors, (527), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2024-10-12 21:43:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 652 transitions. [2024-10-12 21:43:32,419 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 652 transitions. Word has length 58 [2024-10-12 21:43:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:32,420 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 652 transitions. [2024-10-12 21:43:32,420 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:43:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 652 transitions. [2024-10-12 21:43:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:32,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:32,421 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:43:32,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:43:32,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:32,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1782347513, now seen corresponding path program 1 times [2024-10-12 21:43:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:32,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079874382] [2024-10-12 21:43:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:32,603 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:43:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079874382] [2024-10-12 21:43:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079874382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528450848] [2024-10-12 21:43:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:32,608 INFO L87 Difference]: Start difference. First operand 449 states and 652 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:43:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:33,675 INFO L93 Difference]: Finished difference Result 805 states and 1127 transitions. [2024-10-12 21:43:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:43:33,676 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:43:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:33,679 INFO L225 Difference]: With dead ends: 805 [2024-10-12 21:43:33,679 INFO L226 Difference]: Without dead ends: 547 [2024-10-12 21:43:33,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:43:33,681 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 754 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:33,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1065 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:43:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-12 21:43:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 459. [2024-10-12 21:43:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 364 states have (on average 1.4697802197802199) internal successors, (535), 373 states have internal predecessors, (535), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2024-10-12 21:43:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 660 transitions. [2024-10-12 21:43:33,740 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 660 transitions. Word has length 58 [2024-10-12 21:43:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 660 transitions. [2024-10-12 21:43:33,742 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:43:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 660 transitions. [2024-10-12 21:43:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:33,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:33,744 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:43:33,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:43:33,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2089917957, now seen corresponding path program 1 times [2024-10-12 21:43:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:33,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466894840] [2024-10-12 21:43:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:33,860 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:43:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466894840] [2024-10-12 21:43:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466894840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:33,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:33,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426168167] [2024-10-12 21:43:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:33,863 INFO L87 Difference]: Start difference. First operand 459 states and 660 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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:43:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:34,535 INFO L93 Difference]: Finished difference Result 1041 states and 1447 transitions. [2024-10-12 21:43:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:43:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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 58 [2024-10-12 21:43:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:34,541 INFO L225 Difference]: With dead ends: 1041 [2024-10-12 21:43:34,541 INFO L226 Difference]: Without dead ends: 774 [2024-10-12 21:43:34,542 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:43:34,543 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 734 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:34,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 857 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-12 21:43:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 720. [2024-10-12 21:43:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 559 states have (on average 1.4186046511627908) internal successors, (793), 575 states have internal predecessors, (793), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2024-10-12 21:43:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1010 transitions. [2024-10-12 21:43:34,599 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1010 transitions. Word has length 58 [2024-10-12 21:43:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:34,602 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1010 transitions. [2024-10-12 21:43:34,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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:43:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1010 transitions. [2024-10-12 21:43:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:43:34,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:34,608 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:43:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:43:34,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1061083199, now seen corresponding path program 1 times [2024-10-12 21:43:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065449576] [2024-10-12 21:43:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:34,693 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:43:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065449576] [2024-10-12 21:43:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065449576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:34,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324709281] [2024-10-12 21:43:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:34,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:34,699 INFO L87 Difference]: Start difference. First operand 720 states and 1010 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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:43:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:35,328 INFO L93 Difference]: Finished difference Result 1804 states and 2456 transitions. [2024-10-12 21:43:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:43:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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 59 [2024-10-12 21:43:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:35,336 INFO L225 Difference]: With dead ends: 1804 [2024-10-12 21:43:35,336 INFO L226 Difference]: Without dead ends: 1285 [2024-10-12 21:43:35,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:43:35,340 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 921 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:35,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 577 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-10-12 21:43:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1131. [2024-10-12 21:43:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 870 states have (on average 1.3712643678160918) internal successors, (1193), 893 states have internal predecessors, (1193), 141 states have call successors, (141), 94 states have call predecessors, (141), 118 states have return successors, (195), 150 states have call predecessors, (195), 137 states have call successors, (195) [2024-10-12 21:43:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1529 transitions. [2024-10-12 21:43:35,423 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1529 transitions. Word has length 59 [2024-10-12 21:43:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:35,423 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1529 transitions. [2024-10-12 21:43:35,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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:43:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1529 transitions. [2024-10-12 21:43:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:43:35,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:35,426 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:43:35,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:43:35,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 578816900, now seen corresponding path program 1 times [2024-10-12 21:43:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732624419] [2024-10-12 21:43:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,515 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:43:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732624419] [2024-10-12 21:43:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732624419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:35,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459510857] [2024-10-12 21:43:35,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:35,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:35,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:35,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:35,518 INFO L87 Difference]: Start difference. First operand 1131 states and 1529 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:43:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:36,251 INFO L93 Difference]: Finished difference Result 3091 states and 4092 transitions. [2024-10-12 21:43:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:36,252 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:43:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:36,262 INFO L225 Difference]: With dead ends: 3091 [2024-10-12 21:43:36,262 INFO L226 Difference]: Without dead ends: 2131 [2024-10-12 21:43:36,264 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:43:36,265 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 681 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:36,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 678 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-10-12 21:43:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1947. [2024-10-12 21:43:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1488 states have (on average 1.334005376344086) internal successors, (1985), 1517 states have internal predecessors, (1985), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2024-10-12 21:43:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2553 transitions. [2024-10-12 21:43:36,421 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2553 transitions. Word has length 60 [2024-10-12 21:43:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:36,421 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 2553 transitions. [2024-10-12 21:43:36,421 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:43:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2553 transitions. [2024-10-12 21:43:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:43:36,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:36,424 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:43:36,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:43:36,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:36,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash 369508739, now seen corresponding path program 1 times [2024-10-12 21:43:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544504666] [2024-10-12 21:43:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,492 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:43:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544504666] [2024-10-12 21:43:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544504666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:36,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230918433] [2024-10-12 21:43:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:36,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:36,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:36,495 INFO L87 Difference]: Start difference. First operand 1947 states and 2553 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:43:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:37,297 INFO L93 Difference]: Finished difference Result 4611 states and 5957 transitions. [2024-10-12 21:43:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:37,298 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:43:37,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:37,314 INFO L225 Difference]: With dead ends: 4611 [2024-10-12 21:43:37,314 INFO L226 Difference]: Without dead ends: 2855 [2024-10-12 21:43:37,320 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:43:37,321 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 723 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:37,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 747 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-10-12 21:43:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2613. [2024-10-12 21:43:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 1990 states have (on average 1.3180904522613066) internal successors, (2623), 2027 states have internal predecessors, (2623), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2024-10-12 21:43:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3380 transitions. [2024-10-12 21:43:37,560 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3380 transitions. Word has length 66 [2024-10-12 21:43:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:37,561 INFO L471 AbstractCegarLoop]: Abstraction has 2613 states and 3380 transitions. [2024-10-12 21:43:37,561 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:43:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3380 transitions. [2024-10-12 21:43:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 21:43:37,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:37,564 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:43:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:43:37,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1946506328, now seen corresponding path program 1 times [2024-10-12 21:43:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467110634] [2024-10-12 21:43:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,654 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:43:37,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:37,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467110634] [2024-10-12 21:43:37,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467110634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:37,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:37,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676875665] [2024-10-12 21:43:37,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:37,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:37,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:37,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:37,656 INFO L87 Difference]: Start difference. First operand 2613 states and 3380 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:43:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:38,615 INFO L93 Difference]: Finished difference Result 3333 states and 4257 transitions. [2024-10-12 21:43:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:43:38,616 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:43:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:38,631 INFO L225 Difference]: With dead ends: 3333 [2024-10-12 21:43:38,632 INFO L226 Difference]: Without dead ends: 3330 [2024-10-12 21:43:38,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:43:38,634 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 1107 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:38,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 721 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:43:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2024-10-12 21:43:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3063. [2024-10-12 21:43:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2331 states have (on average 1.308880308880309) internal successors, (3051), 2373 states have internal predecessors, (3051), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2024-10-12 21:43:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 3937 transitions. [2024-10-12 21:43:38,977 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 3937 transitions. Word has length 67 [2024-10-12 21:43:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 3937 transitions. [2024-10-12 21:43:38,978 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:43:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 3937 transitions. [2024-10-12 21:43:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:43:38,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:38,980 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:43:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:43:38,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash -213033363, now seen corresponding path program 1 times [2024-10-12 21:43:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792652737] [2024-10-12 21:43:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,143 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:43:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792652737] [2024-10-12 21:43:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792652737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:43:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92127030] [2024-10-12 21:43:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:43:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:43:39,146 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:43:39,147 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:43:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:43:39,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:43:39,505 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:43:39,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:43:39,612 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:43:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92127030] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:43:39,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:43:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-12 21:43:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372560473] [2024-10-12 21:43:39,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:43:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:43:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:43:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:43:39,614 INFO L87 Difference]: Start difference. First operand 3063 states and 3937 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:43:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:41,748 INFO L93 Difference]: Finished difference Result 7130 states and 9049 transitions. [2024-10-12 21:43:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 21:43:41,750 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:43:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:41,789 INFO L225 Difference]: With dead ends: 7130 [2024-10-12 21:43:41,790 INFO L226 Difference]: Without dead ends: 7127 [2024-10-12 21:43:41,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:43:41,794 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1484 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:41,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1525 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:43:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2024-10-12 21:43:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 4689. [2024-10-12 21:43:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 3571 states have (on average 1.3057966956034723) internal successors, (4663), 3635 states have internal predecessors, (4663), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2024-10-12 21:43:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6011 transitions. [2024-10-12 21:43:42,412 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6011 transitions. Word has length 68 [2024-10-12 21:43:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6011 transitions. [2024-10-12 21:43:42,413 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:43:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6011 transitions. [2024-10-12 21:43:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:43:42,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:42,416 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:43:42,437 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:43:42,616 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:43:42,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 413265768, now seen corresponding path program 2 times [2024-10-12 21:43:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938697338] [2024-10-12 21:43:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,716 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:43:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938697338] [2024-10-12 21:43:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938697338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094524364] [2024-10-12 21:43:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:42,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:42,718 INFO L87 Difference]: Start difference. First operand 4689 states and 6011 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:43:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:43,507 INFO L93 Difference]: Finished difference Result 7145 states and 9158 transitions. [2024-10-12 21:43:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:43:43,507 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:43:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:43,527 INFO L225 Difference]: With dead ends: 7145 [2024-10-12 21:43:43,528 INFO L226 Difference]: Without dead ends: 3442 [2024-10-12 21:43:43,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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:43:43,536 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 801 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:43,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 640 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:43:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-10-12 21:43:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3213. [2024-10-12 21:43:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 2451 states have (on average 1.2872297021623826) internal successors, (3155), 2493 states have internal predecessors, (3155), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2024-10-12 21:43:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4061 transitions. [2024-10-12 21:43:43,853 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4061 transitions. Word has length 71 [2024-10-12 21:43:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:43,854 INFO L471 AbstractCegarLoop]: Abstraction has 3213 states and 4061 transitions. [2024-10-12 21:43:43,854 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:43:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4061 transitions. [2024-10-12 21:43:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:43:43,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:43,857 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:43:43,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:43:43,858 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:43,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash 965940368, now seen corresponding path program 1 times [2024-10-12 21:43:43,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:43,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801192288] [2024-10-12 21:43:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:43,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:43:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,961 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:43:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801192288] [2024-10-12 21:43:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801192288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368205757] [2024-10-12 21:43:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:43,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:43,963 INFO L87 Difference]: Start difference. First operand 3213 states and 4061 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:43:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:45,466 INFO L93 Difference]: Finished difference Result 9511 states and 11904 transitions. [2024-10-12 21:43:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 21:43:45,466 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:43:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:45,510 INFO L225 Difference]: With dead ends: 9511 [2024-10-12 21:43:45,510 INFO L226 Difference]: Without dead ends: 5274 [2024-10-12 21:43:45,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-12 21:43:45,525 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 907 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:45,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1122 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2024-10-12 21:43:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 4954. [2024-10-12 21:43:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4954 states, 3735 states have (on average 1.259437751004016) internal successors, (4704), 3820 states have internal predecessors, (4704), 585 states have call successors, (585), 482 states have call predecessors, (585), 632 states have return successors, (907), 658 states have call predecessors, (907), 582 states have call successors, (907) [2024-10-12 21:43:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 6196 transitions. [2024-10-12 21:43:46,058 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 6196 transitions. Word has length 76 [2024-10-12 21:43:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:46,059 INFO L471 AbstractCegarLoop]: Abstraction has 4954 states and 6196 transitions. [2024-10-12 21:43:46,059 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:43:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 6196 transitions. [2024-10-12 21:43:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:46,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:46,063 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] [2024-10-12 21:43:46,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:43:46,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 41108918, now seen corresponding path program 1 times [2024-10-12 21:43:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183736981] [2024-10-12 21:43:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,179 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:43:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183736981] [2024-10-12 21:43:46,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183736981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:46,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:46,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551341138] [2024-10-12 21:43:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:46,181 INFO L87 Difference]: Start difference. First operand 4954 states and 6196 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:43:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:47,711 INFO L93 Difference]: Finished difference Result 5375 states and 6874 transitions. [2024-10-12 21:43:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2024-10-12 21:43:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:47,733 INFO L225 Difference]: With dead ends: 5375 [2024-10-12 21:43:47,733 INFO L226 Difference]: Without dead ends: 5216 [2024-10-12 21:43:47,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:43:47,736 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 828 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:47,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 730 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:43:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2024-10-12 21:43:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5115. [2024-10-12 21:43:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 3876 states have (on average 1.2719298245614035) internal successors, (4930), 3962 states have internal predecessors, (4930), 598 states have call successors, (598), 488 states have call predecessors, (598), 639 states have return successors, (923), 671 states have call predecessors, (923), 595 states have call successors, (923) [2024-10-12 21:43:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6451 transitions. [2024-10-12 21:43:48,658 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6451 transitions. Word has length 82 [2024-10-12 21:43:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:48,659 INFO L471 AbstractCegarLoop]: Abstraction has 5115 states and 6451 transitions. [2024-10-12 21:43:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:43:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6451 transitions. [2024-10-12 21:43:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:48,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:48,664 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] [2024-10-12 21:43:48,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:43:48,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:48,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -960990346, now seen corresponding path program 1 times [2024-10-12 21:43:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838596566] [2024-10-12 21:43:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,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:43:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838596566] [2024-10-12 21:43:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838596566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875240410] [2024-10-12 21:43:48,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:48,792 INFO L87 Difference]: Start difference. First operand 5115 states and 6451 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:50,738 INFO L93 Difference]: Finished difference Result 5750 states and 7468 transitions. [2024-10-12 21:43:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:43:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:50,780 INFO L225 Difference]: With dead ends: 5750 [2024-10-12 21:43:50,780 INFO L226 Difference]: Without dead ends: 5430 [2024-10-12 21:43:50,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:43:50,784 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 866 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:50,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 949 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:43:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2024-10-12 21:43:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 5265. [2024-10-12 21:43:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 4006 states have (on average 1.2815776335496756) internal successors, (5134), 4093 states have internal predecessors, (5134), 611 states have call successors, (611), 494 states have call predecessors, (611), 646 states have return successors, (938), 685 states have call predecessors, (938), 608 states have call successors, (938) [2024-10-12 21:43:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 6683 transitions. [2024-10-12 21:43:51,532 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 6683 transitions. Word has length 82 [2024-10-12 21:43:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 5265 states and 6683 transitions. [2024-10-12 21:43:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 6683 transitions. [2024-10-12 21:43:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:51,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:51,538 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] [2024-10-12 21:43:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:43:51,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -7050188, now seen corresponding path program 1 times [2024-10-12 21:43:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392934027] [2024-10-12 21:43:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,665 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:43:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392934027] [2024-10-12 21:43:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392934027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346459662] [2024-10-12 21:43:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:51,666 INFO L87 Difference]: Start difference. First operand 5265 states and 6683 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:53,841 INFO L93 Difference]: Finished difference Result 6299 states and 8336 transitions. [2024-10-12 21:43:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:53,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:43:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:53,866 INFO L225 Difference]: With dead ends: 6299 [2024-10-12 21:43:53,866 INFO L226 Difference]: Without dead ends: 5829 [2024-10-12 21:43:53,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:43:53,874 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 835 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:53,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1254 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:43:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2024-10-12 21:43:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 5566. [2024-10-12 21:43:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5566 states, 4267 states have (on average 1.2990391375673775) internal successors, (5543), 4356 states have internal predecessors, (5543), 637 states have call successors, (637), 506 states have call predecessors, (637), 660 states have return successors, (972), 713 states have call predecessors, (972), 634 states have call successors, (972) [2024-10-12 21:43:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 7152 transitions. [2024-10-12 21:43:54,696 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 7152 transitions. Word has length 82 [2024-10-12 21:43:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 5566 states and 7152 transitions. [2024-10-12 21:43:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 7152 transitions. [2024-10-12 21:43:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:54,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:54,702 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] [2024-10-12 21:43:54,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:43:54,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1223203914, now seen corresponding path program 1 times [2024-10-12 21:43:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602924871] [2024-10-12 21:43:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:54,816 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:43:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602924871] [2024-10-12 21:43:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602924871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:54,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:54,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443386126] [2024-10-12 21:43:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:54,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:54,819 INFO L87 Difference]: Start difference. First operand 5566 states and 7152 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:56,428 INFO L93 Difference]: Finished difference Result 6588 states and 8796 transitions. [2024-10-12 21:43:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:43:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:56,446 INFO L225 Difference]: With dead ends: 6588 [2024-10-12 21:43:56,447 INFO L226 Difference]: Without dead ends: 5817 [2024-10-12 21:43:56,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:43:56,451 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 677 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:56,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 742 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5817 states. [2024-10-12 21:43:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5817 to 5566. [2024-10-12 21:43:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5566 states, 4267 states have (on average 1.29786735411296) internal successors, (5538), 4356 states have internal predecessors, (5538), 637 states have call successors, (637), 506 states have call predecessors, (637), 660 states have return successors, (972), 713 states have call predecessors, (972), 634 states have call successors, (972) [2024-10-12 21:43:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 7147 transitions. [2024-10-12 21:43:57,187 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 7147 transitions. Word has length 82 [2024-10-12 21:43:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:57,187 INFO L471 AbstractCegarLoop]: Abstraction has 5566 states and 7147 transitions. [2024-10-12 21:43:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 7147 transitions. [2024-10-12 21:43:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:57,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:57,192 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] [2024-10-12 21:43:57,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:43:57,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1955171340, now seen corresponding path program 1 times [2024-10-12 21:43:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681674427] [2024-10-12 21:43:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:57,370 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:43:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681674427] [2024-10-12 21:43:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681674427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798690069] [2024-10-12 21:43:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:57,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:57,380 INFO L87 Difference]: Start difference. First operand 5566 states and 7147 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:59,029 INFO L93 Difference]: Finished difference Result 6582 states and 8770 transitions. [2024-10-12 21:43:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:43:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:59,054 INFO L225 Difference]: With dead ends: 6582 [2024-10-12 21:43:59,054 INFO L226 Difference]: Without dead ends: 5811 [2024-10-12 21:43:59,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:43:59,062 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 794 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:59,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 613 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2024-10-12 21:43:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 5566. [2024-10-12 21:43:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5566 states, 4267 states have (on average 1.2966955706585424) internal successors, (5533), 4356 states have internal predecessors, (5533), 637 states have call successors, (637), 506 states have call predecessors, (637), 660 states have return successors, (972), 713 states have call predecessors, (972), 634 states have call successors, (972) [2024-10-12 21:43:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 7142 transitions. [2024-10-12 21:43:59,856 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 7142 transitions. Word has length 82 [2024-10-12 21:43:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:59,856 INFO L471 AbstractCegarLoop]: Abstraction has 5566 states and 7142 transitions. [2024-10-12 21:43:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:43:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 7142 transitions. [2024-10-12 21:43:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:43:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:59,861 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] [2024-10-12 21:43:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:43:59,861 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 653616118, now seen corresponding path program 1 times [2024-10-12 21:43:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50170329] [2024-10-12 21:43:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:43:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:43:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:43:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:43:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:59,976 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:43:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50170329] [2024-10-12 21:43:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50170329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:59,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793959044] [2024-10-12 21:43:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:59,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:59,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:59,978 INFO L87 Difference]: Start difference. First operand 5566 states and 7142 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:02,078 INFO L93 Difference]: Finished difference Result 7517 states and 10211 transitions. [2024-10-12 21:44:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:02,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:02,106 INFO L225 Difference]: With dead ends: 7517 [2024-10-12 21:44:02,106 INFO L226 Difference]: Without dead ends: 6746 [2024-10-12 21:44:02,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:02,113 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 935 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:02,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1243 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:44:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2024-10-12 21:44:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6134. [2024-10-12 21:44:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 4759 states have (on average 1.3210758562723262) internal successors, (6287), 4852 states have internal predecessors, (6287), 685 states have call successors, (685), 530 states have call predecessors, (685), 688 states have return successors, (1042), 765 states have call predecessors, (1042), 682 states have call successors, (1042) [2024-10-12 21:44:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8014 transitions. [2024-10-12 21:44:02,963 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8014 transitions. Word has length 82 [2024-10-12 21:44:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:02,964 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8014 transitions. [2024-10-12 21:44:02,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8014 transitions. [2024-10-12 21:44:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:44:02,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:02,970 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] [2024-10-12 21:44:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:44:02,971 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 236219512, now seen corresponding path program 1 times [2024-10-12 21:44:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566369714] [2024-10-12 21:44:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,097 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:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:03,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566369714] [2024-10-12 21:44:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566369714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:03,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838145429] [2024-10-12 21:44:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:03,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:03,100 INFO L87 Difference]: Start difference. First operand 6134 states and 8014 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:04,674 INFO L93 Difference]: Finished difference Result 7848 states and 10718 transitions. [2024-10-12 21:44:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:04,696 INFO L225 Difference]: With dead ends: 7848 [2024-10-12 21:44:04,697 INFO L226 Difference]: Without dead ends: 6509 [2024-10-12 21:44:04,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:04,702 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 789 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:04,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 612 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:44:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2024-10-12 21:44:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 6134. [2024-10-12 21:44:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 4759 states have (on average 1.3191847026686279) internal successors, (6278), 4852 states have internal predecessors, (6278), 685 states have call successors, (685), 530 states have call predecessors, (685), 688 states have return successors, (1042), 765 states have call predecessors, (1042), 682 states have call successors, (1042) [2024-10-12 21:44:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8005 transitions. [2024-10-12 21:44:05,518 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8005 transitions. Word has length 82 [2024-10-12 21:44:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:05,518 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8005 transitions. [2024-10-12 21:44:05,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8005 transitions. [2024-10-12 21:44:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:44:05,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:05,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:44:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:44:05,524 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 915491766, now seen corresponding path program 1 times [2024-10-12 21:44:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363702605] [2024-10-12 21:44:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,642 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:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363702605] [2024-10-12 21:44:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363702605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:05,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782123492] [2024-10-12 21:44:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:05,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:05,644 INFO L87 Difference]: Start difference. First operand 6134 states and 8005 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:07,749 INFO L93 Difference]: Finished difference Result 9473 states and 13197 transitions. [2024-10-12 21:44:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:07,777 INFO L225 Difference]: With dead ends: 9473 [2024-10-12 21:44:07,777 INFO L226 Difference]: Without dead ends: 8134 [2024-10-12 21:44:07,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:07,784 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 858 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:07,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1247 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:44:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8134 states. [2024-10-12 21:44:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8134 to 7312. [2024-10-12 21:44:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7312 states, 5789 states have (on average 1.3567110036275696) internal successors, (7854), 5890 states have internal predecessors, (7854), 777 states have call successors, (777), 578 states have call predecessors, (777), 744 states have return successors, (1196), 865 states have call predecessors, (1196), 774 states have call successors, (1196) [2024-10-12 21:44:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7312 states to 7312 states and 9827 transitions. [2024-10-12 21:44:08,763 INFO L78 Accepts]: Start accepts. Automaton has 7312 states and 9827 transitions. Word has length 82 [2024-10-12 21:44:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:08,763 INFO L471 AbstractCegarLoop]: Abstraction has 7312 states and 9827 transitions. [2024-10-12 21:44:08,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 7312 states and 9827 transitions. [2024-10-12 21:44:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:44:08,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:08,769 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] [2024-10-12 21:44:08,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:44:08,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1417900872, now seen corresponding path program 1 times [2024-10-12 21:44:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775348791] [2024-10-12 21:44:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:08,914 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:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775348791] [2024-10-12 21:44:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775348791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311594165] [2024-10-12 21:44:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:08,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:08,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:08,916 INFO L87 Difference]: Start difference. First operand 7312 states and 9827 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:10,969 INFO L93 Difference]: Finished difference Result 13489 states and 19457 transitions. [2024-10-12 21:44:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:11,007 INFO L225 Difference]: With dead ends: 13489 [2024-10-12 21:44:11,007 INFO L226 Difference]: Without dead ends: 10972 [2024-10-12 21:44:11,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:11,017 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 862 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:11,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 905 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:44:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10972 states. [2024-10-12 21:44:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10972 to 9665. [2024-10-12 21:44:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9665 states, 7854 states have (on average 1.4025974025974026) internal successors, (11016), 7971 states have internal predecessors, (11016), 953 states have call successors, (953), 674 states have call predecessors, (953), 856 states have return successors, (1550), 1057 states have call predecessors, (1550), 950 states have call successors, (1550) [2024-10-12 21:44:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 13519 transitions. [2024-10-12 21:44:12,218 INFO L78 Accepts]: Start accepts. Automaton has 9665 states and 13519 transitions. Word has length 82 [2024-10-12 21:44:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:12,218 INFO L471 AbstractCegarLoop]: Abstraction has 9665 states and 13519 transitions. [2024-10-12 21:44:12,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9665 states and 13519 transitions. [2024-10-12 21:44:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:44:12,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:12,227 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] [2024-10-12 21:44:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:44:12,227 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1216076938, now seen corresponding path program 1 times [2024-10-12 21:44:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915021237] [2024-10-12 21:44:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:12,340 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:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915021237] [2024-10-12 21:44:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915021237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:12,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:44:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879090211] [2024-10-12 21:44:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:12,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:44:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:12,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:44:12,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:44:12,343 INFO L87 Difference]: Start difference. First operand 9665 states and 13519 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:44:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:14,187 INFO L93 Difference]: Finished difference Result 15663 states and 23003 transitions. [2024-10-12 21:44:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:14,219 INFO L225 Difference]: With dead ends: 15663 [2024-10-12 21:44:14,219 INFO L226 Difference]: Without dead ends: 10794 [2024-10-12 21:44:14,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:44:14,235 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 302 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:14,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 846 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:44:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2024-10-12 21:44:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 9731. [2024-10-12 21:44:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9731 states, 7920 states have (on average 1.3992424242424242) internal successors, (11082), 8037 states have internal predecessors, (11082), 953 states have call successors, (953), 674 states have call predecessors, (953), 856 states have return successors, (1550), 1057 states have call predecessors, (1550), 950 states have call successors, (1550) [2024-10-12 21:44:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 13585 transitions. [2024-10-12 21:44:15,362 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 13585 transitions. Word has length 82 [2024-10-12 21:44:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 9731 states and 13585 transitions. [2024-10-12 21:44:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:44:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 13585 transitions. [2024-10-12 21:44:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:44:15,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:15,370 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] [2024-10-12 21:44:15,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:44:15,371 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash 322263092, now seen corresponding path program 1 times [2024-10-12 21:44:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:15,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544812781] [2024-10-12 21:44:15,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:15,519 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:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544812781] [2024-10-12 21:44:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544812781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712368536] [2024-10-12 21:44:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:15,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:15,521 INFO L87 Difference]: Start difference. First operand 9731 states and 13585 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:18,782 INFO L93 Difference]: Finished difference Result 26853 states and 40823 transitions. [2024-10-12 21:44:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:44:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-12 21:44:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:18,865 INFO L225 Difference]: With dead ends: 26853 [2024-10-12 21:44:18,866 INFO L226 Difference]: Without dead ends: 21918 [2024-10-12 21:44:18,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:44:18,898 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1740 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:18,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 1029 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:44:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21918 states. [2024-10-12 21:44:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21918 to 19004. [2024-10-12 21:44:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19004 states, 15983 states have (on average 1.4493524369642745) internal successors, (23165), 16215 states have internal predecessors, (23165), 1697 states have call successors, (1697), 1076 states have call predecessors, (1697), 1322 states have return successors, (2997), 1750 states have call predecessors, (2997), 1694 states have call successors, (2997) [2024-10-12 21:44:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19004 states to 19004 states and 27859 transitions. [2024-10-12 21:44:20,829 INFO L78 Accepts]: Start accepts. Automaton has 19004 states and 27859 transitions. Word has length 82 [2024-10-12 21:44:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:20,829 INFO L471 AbstractCegarLoop]: Abstraction has 19004 states and 27859 transitions. [2024-10-12 21:44:20,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:44:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19004 states and 27859 transitions. [2024-10-12 21:44:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:44:20,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:20,837 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:44:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:44:20,837 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:20,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1856308475, now seen corresponding path program 1 times [2024-10-12 21:44:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:20,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150408669] [2024-10-12 21:44:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:44:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,949 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:44:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150408669] [2024-10-12 21:44:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150408669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:44:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620304656] [2024-10-12 21:44:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:44:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:20,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:44:20,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:44:20,951 INFO L87 Difference]: Start difference. First operand 19004 states and 27859 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:44:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:23,671 INFO L93 Difference]: Finished difference Result 22675 states and 32367 transitions. [2024-10-12 21:44:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 21:44:23,671 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:44:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:23,712 INFO L225 Difference]: With dead ends: 22675 [2024-10-12 21:44:23,713 INFO L226 Difference]: Without dead ends: 18495 [2024-10-12 21:44:23,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-12 21:44:23,726 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 1528 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:23,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 962 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:44:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18495 states. [2024-10-12 21:44:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18495 to 18161. [2024-10-12 21:44:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18161 states, 15353 states have (on average 1.455415879632645) internal successors, (22345), 15567 states have internal predecessors, (22345), 1598 states have call successors, (1598), 991 states have call predecessors, (1598), 1208 states have return successors, (2775), 1640 states have call predecessors, (2775), 1595 states have call successors, (2775) [2024-10-12 21:44:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18161 states to 18161 states and 26718 transitions. [2024-10-12 21:44:25,384 INFO L78 Accepts]: Start accepts. Automaton has 18161 states and 26718 transitions. Word has length 86 [2024-10-12 21:44:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:25,385 INFO L471 AbstractCegarLoop]: Abstraction has 18161 states and 26718 transitions. [2024-10-12 21:44:25,385 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:44:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18161 states and 26718 transitions. [2024-10-12 21:44:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:44:25,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:25,407 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:44:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:44:25,407 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1632721171, now seen corresponding path program 1 times [2024-10-12 21:44:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598743655] [2024-10-12 21:44:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:44:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:44:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 21:44:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 21:44:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 21:44:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 21:44:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 21:44:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,543 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:44:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598743655] [2024-10-12 21:44:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598743655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:44:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526778956] [2024-10-12 21:44:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:25,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:44:25,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:44:25,546 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:44:25,547 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:44:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:44:25,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:44:25,697 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:44:25,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:44:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526778956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:25,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:44:25,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-12 21:44:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078886164] [2024-10-12 21:44:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:25,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:44:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:44:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:44:25,700 INFO L87 Difference]: Start difference. First operand 18161 states and 26718 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:44:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:26,941 INFO L93 Difference]: Finished difference Result 20008 states and 28971 transitions. [2024-10-12 21:44:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:44:26,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-12 21:44:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:26,973 INFO L225 Difference]: With dead ends: 20008 [2024-10-12 21:44:26,973 INFO L226 Difference]: Without dead ends: 16092 [2024-10-12 21:44:26,980 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:44:26,981 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:26,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1753 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:44:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16092 states. [2024-10-12 21:44:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16092 to 16092. [2024-10-12 21:44:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16092 states, 13861 states have (on average 1.477959743164274) internal successors, (20486), 14024 states have internal predecessors, (20486), 1322 states have call successors, (1322), 757 states have call predecessors, (1322), 907 states have return successors, (2382), 1342 states have call predecessors, (2382), 1319 states have call successors, (2382) [2024-10-12 21:44:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16092 states to 16092 states and 24190 transitions. [2024-10-12 21:44:28,188 INFO L78 Accepts]: Start accepts. Automaton has 16092 states and 24190 transitions. Word has length 131 [2024-10-12 21:44:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 16092 states and 24190 transitions. [2024-10-12 21:44:28,188 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:44:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16092 states and 24190 transitions. [2024-10-12 21:44:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 21:44:28,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:28,205 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:44:28,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 21:44:28,405 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,SelfDestructingSolverStorable25 [2024-10-12 21:44:28,406 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1788953059, now seen corresponding path program 1 times [2024-10-12 21:44:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672717702] [2024-10-12 21:44:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:44:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:44:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:44:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:44:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:44:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 21:44:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:44:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:44:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:44:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:44:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 21:44:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 21:44:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 21:44:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,487 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:44:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672717702] [2024-10-12 21:44:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672717702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:28,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:28,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:44:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446614122] [2024-10-12 21:44:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:44:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:44:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:44:28,489 INFO L87 Difference]: Start difference. First operand 16092 states and 24190 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:44:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:30,315 INFO L93 Difference]: Finished difference Result 16157 states and 24258 transitions. [2024-10-12 21:44:30,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:30,315 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:44:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:30,362 INFO L225 Difference]: With dead ends: 16157 [2024-10-12 21:44:30,362 INFO L226 Difference]: Without dead ends: 15755 [2024-10-12 21:44:30,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:44:30,372 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 550 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:30,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 633 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:44:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2024-10-12 21:44:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15693. [2024-10-12 21:44:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15693 states, 13558 states have (on average 1.484215961056203) internal successors, (20123), 13718 states have internal predecessors, (20123), 1276 states have call successors, (1276), 717 states have call predecessors, (1276), 857 states have return successors, (2318), 1289 states have call predecessors, (2318), 1273 states have call successors, (2318) [2024-10-12 21:44:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15693 states to 15693 states and 23717 transitions. [2024-10-12 21:44:31,589 INFO L78 Accepts]: Start accepts. Automaton has 15693 states and 23717 transitions. Word has length 133 [2024-10-12 21:44:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 15693 states and 23717 transitions. [2024-10-12 21:44:31,589 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:44:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15693 states and 23717 transitions. [2024-10-12 21:44:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 21:44:31,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:31,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 21:44:31,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:44:31,606 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2036920418, now seen corresponding path program 1 times [2024-10-12 21:44:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545764303] [2024-10-12 21:44:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 21:44:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:44:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:44:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 21:44:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545764303] [2024-10-12 21:44:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545764303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:44:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925463816] [2024-10-12 21:44:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:44:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:44:31,722 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:44:31,723 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:44:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:31,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:44:31,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:44:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 21:44:31,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:44:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925463816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:44:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:44:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828754214] [2024-10-12 21:44:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:31,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:44:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:44:31,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:31,880 INFO L87 Difference]: Start difference. First operand 15693 states and 23717 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:44:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:33,839 INFO L93 Difference]: Finished difference Result 43804 states and 67760 transitions. [2024-10-12 21:44:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:44:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-12 21:44:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:33,917 INFO L225 Difference]: With dead ends: 43804 [2024-10-12 21:44:33,917 INFO L226 Difference]: Without dead ends: 29596 [2024-10-12 21:44:33,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:33,948 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 330 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:33,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 566 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:44:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29596 states. [2024-10-12 21:44:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29596 to 29492. [2024-10-12 21:44:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29492 states, 25587 states have (on average 1.490757025051784) internal successors, (38144), 25894 states have internal predecessors, (38144), 2350 states have call successors, (2350), 1317 states have call predecessors, (2350), 1553 states have return successors, (4312), 2312 states have call predecessors, (4312), 2347 states have call successors, (4312) [2024-10-12 21:44:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29492 states to 29492 states and 44806 transitions. [2024-10-12 21:44:36,117 INFO L78 Accepts]: Start accepts. Automaton has 29492 states and 44806 transitions. Word has length 132 [2024-10-12 21:44:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:36,117 INFO L471 AbstractCegarLoop]: Abstraction has 29492 states and 44806 transitions. [2024-10-12 21:44:36,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:44:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29492 states and 44806 transitions. [2024-10-12 21:44:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 21:44:36,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:36,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 21:44:36,157 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:44:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:44:36,346 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:36,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1022918018, now seen corresponding path program 1 times [2024-10-12 21:44:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333047325] [2024-10-12 21:44:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:44:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:44:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:44:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:44:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 21:44:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:44:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:44:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 21:44:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333047325] [2024-10-12 21:44:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333047325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:44:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039447562] [2024-10-12 21:44:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:36,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:44:36,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:44:36,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:44:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:44:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:44:36,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:44:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 21:44:36,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:44:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039447562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:36,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:44:36,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:44:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447039881] [2024-10-12 21:44:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:44:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:36,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:44:36,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:36,641 INFO L87 Difference]: Start difference. First operand 29492 states and 44806 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)