./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.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:04:00,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:04:00,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:04:00,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:04:00,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:04:00,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:04:00,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:04:00,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:04:00,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:04:00,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:04:00,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:04:00,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:04:00,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:04:00,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:04:00,235 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:04:00,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:04:00,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:04:00,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:04:00,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:04:00,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:04:00,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:04:00,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:04:00,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:04:00,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:04:00,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:04:00,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:04:00,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:04:00,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:04:00,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:04:00,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:04:00,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:04:00,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:04:00,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:00,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:04:00,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:04:00,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:04:00,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:04:00,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:04:00,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:04:00,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:04:00,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:04:00,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:04:00,242 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-clean/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-clean/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 -> 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f [2024-10-11 05:04:00,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:04:00,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:04:00,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:04:00,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:04:00,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:04:00,483 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.10.cil-1.c [2024-10-11 05:04:01,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:04:02,064 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:04:02,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2024-10-11 05:04:02,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6886df608/58bfe6ec793b4be9ac6793f5ce1e49df/FLAGcc31ab60a [2024-10-11 05:04:02,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6886df608/58bfe6ec793b4be9ac6793f5ce1e49df [2024-10-11 05:04:02,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:04:02,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:04:02,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:02,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:04:02,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:04:02,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a5ed4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02, skipping insertion in model container [2024-10-11 05:04:02,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:04:02,289 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.10.cil-1.c[914,927] [2024-10-11 05:04:02,343 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.10.cil-1.c[7115,7128] [2024-10-11 05:04:02,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:02,436 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:04:02,460 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.10.cil-1.c[914,927] [2024-10-11 05:04:02,503 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.10.cil-1.c[7115,7128] [2024-10-11 05:04:02,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:02,584 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:04:02,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02 WrapperNode [2024-10-11 05:04:02,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:02,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:02,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:04:02,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:04:02,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,718 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 954 [2024-10-11 05:04:02,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:02,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:04:02,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:04:02,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:04:02,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,750 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-11 05:04:02,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:04:02,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:04:02,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:04:02,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:04:02,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (1/1) ... [2024-10-11 05:04:02,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:02,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:04:02,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:04:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:04:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:04:02,896 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:04:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:04:02,896 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:04:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:04:02,896 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:04:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:04:02,897 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:04:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:04:02,897 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:04:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:04:02,897 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:04:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:04:02,897 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:04:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:04:02,898 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:04:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:04:02,898 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:04:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:04:02,898 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:04:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:04:02,899 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:04:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:04:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:04:02,899 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:04:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:04:02,899 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:04:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:04:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:04:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:04:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:04:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:04:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:04:03,005 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:04:03,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:04:03,849 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-10-11 05:04:03,849 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:04:03,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:04:03,922 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 05:04:03,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:03 BoogieIcfgContainer [2024-10-11 05:04:03,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:04:03,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:04:03,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:04:03,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:04:03,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:04:02" (1/3) ... [2024-10-11 05:04:03,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598c9bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:03, skipping insertion in model container [2024-10-11 05:04:03,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:02" (2/3) ... [2024-10-11 05:04:03,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598c9bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:03, skipping insertion in model container [2024-10-11 05:04:03,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:03" (3/3) ... [2024-10-11 05:04:03,932 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2024-10-11 05:04:03,947 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:04:03,948 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:04:04,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:04:04,020 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;@59bf0cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:04:04,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:04:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 343 states have (on average 1.7113702623906706) internal successors, (587), 351 states have internal predecessors, (587), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 05:04:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:04,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:04,036 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-11 05:04:04,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:04,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1105280806, now seen corresponding path program 1 times [2024-10-11 05:04:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015093409] [2024-10-11 05:04:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,649 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-11 05:04:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015093409] [2024-10-11 05:04:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015093409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346590438] [2024-10-11 05:04:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:04,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:04,705 INFO L87 Difference]: Start difference. First operand has 401 states, 343 states have (on average 1.7113702623906706) internal successors, (587), 351 states have internal predecessors, (587), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) 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-11 05:04:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:05,997 INFO L93 Difference]: Finished difference Result 903 states and 1489 transitions. [2024-10-11 05:04:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:06,000 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-11 05:04:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:06,011 INFO L225 Difference]: With dead ends: 903 [2024-10-11 05:04:06,012 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 05:04:06,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:06,020 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1323 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:06,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1371 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 05:04:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 483. [2024-10-11 05:04:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 408 states have (on average 1.5759803921568627) internal successors, (643), 415 states have internal predecessors, (643), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-10-11 05:04:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 746 transitions. [2024-10-11 05:04:06,120 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 746 transitions. Word has length 58 [2024-10-11 05:04:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 746 transitions. [2024-10-11 05:04:06,121 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-11 05:04:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 746 transitions. [2024-10-11 05:04:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:06,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:06,123 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-11 05:04:06,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:04:06,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1239514470, now seen corresponding path program 1 times [2024-10-11 05:04:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628088199] [2024-10-11 05:04:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,327 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-11 05:04:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:06,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628088199] [2024-10-11 05:04:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628088199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588868122] [2024-10-11 05:04:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:06,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:06,330 INFO L87 Difference]: Start difference. First operand 483 states and 746 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-11 05:04:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:07,446 INFO L93 Difference]: Finished difference Result 803 states and 1196 transitions. [2024-10-11 05:04:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:07,448 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-11 05:04:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:07,455 INFO L225 Difference]: With dead ends: 803 [2024-10-11 05:04:07,455 INFO L226 Difference]: Without dead ends: 641 [2024-10-11 05:04:07,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:04:07,459 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1183 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1846 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-11 05:04:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 571. [2024-10-11 05:04:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 476 states have (on average 1.5525210084033614) internal successors, (739), 485 states have internal predecessors, (739), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2024-10-11 05:04:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 872 transitions. [2024-10-11 05:04:07,509 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 872 transitions. Word has length 58 [2024-10-11 05:04:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 872 transitions. [2024-10-11 05:04:07,510 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-11 05:04:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 872 transitions. [2024-10-11 05:04:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:07,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:07,516 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-11 05:04:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:04:07,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:07,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 688758232, now seen corresponding path program 1 times [2024-10-11 05:04:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820827392] [2024-10-11 05:04:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820827392] [2024-10-11 05:04:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820827392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415205761] [2024-10-11 05:04:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:07,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:07,671 INFO L87 Difference]: Start difference. First operand 571 states and 872 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-11 05:04:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:08,688 INFO L93 Difference]: Finished difference Result 845 states and 1258 transitions. [2024-10-11 05:04:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:08,689 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-11 05:04:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:08,692 INFO L225 Difference]: With dead ends: 845 [2024-10-11 05:04:08,692 INFO L226 Difference]: Without dead ends: 601 [2024-10-11 05:04:08,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:04:08,694 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 799 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:08,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1975 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-11 05:04:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 575. [2024-10-11 05:04:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 479 states have (on average 1.5448851774530272) internal successors, (740), 488 states have internal predecessors, (740), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2024-10-11 05:04:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 874 transitions. [2024-10-11 05:04:08,718 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 874 transitions. Word has length 58 [2024-10-11 05:04:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:08,718 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 874 transitions. [2024-10-11 05:04:08,719 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-11 05:04:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 874 transitions. [2024-10-11 05:04:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:08,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:08,720 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-11 05:04:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:04:08,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1555225066, now seen corresponding path program 1 times [2024-10-11 05:04:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230906572] [2024-10-11 05:04:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,863 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-11 05:04:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230906572] [2024-10-11 05:04:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230906572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:08,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67303102] [2024-10-11 05:04:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:08,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:08,866 INFO L87 Difference]: Start difference. First operand 575 states and 874 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-11 05:04:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:09,817 INFO L93 Difference]: Finished difference Result 863 states and 1276 transitions. [2024-10-11 05:04:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:09,817 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-11 05:04:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:09,820 INFO L225 Difference]: With dead ends: 863 [2024-10-11 05:04:09,821 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 05:04:09,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:09,822 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 805 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:09,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1974 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:04:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 05:04:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 587. [2024-10-11 05:04:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 488 states have (on average 1.5348360655737705) internal successors, (749), 497 states have internal predecessors, (749), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2024-10-11 05:04:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 886 transitions. [2024-10-11 05:04:09,845 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 886 transitions. Word has length 58 [2024-10-11 05:04:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 886 transitions. [2024-10-11 05:04:09,846 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-11 05:04:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 886 transitions. [2024-10-11 05:04:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:09,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:09,847 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-11 05:04:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:04:09,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:09,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1493185452, now seen corresponding path program 1 times [2024-10-11 05:04:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:09,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364246103] [2024-10-11 05:04:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,029 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-11 05:04:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364246103] [2024-10-11 05:04:10,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364246103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:10,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:10,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342413741] [2024-10-11 05:04:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:10,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:10,032 INFO L87 Difference]: Start difference. First operand 587 states and 886 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-11 05:04:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:10,993 INFO L93 Difference]: Finished difference Result 943 states and 1361 transitions. [2024-10-11 05:04:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:10,993 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-11 05:04:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:10,996 INFO L225 Difference]: With dead ends: 943 [2024-10-11 05:04:10,997 INFO L226 Difference]: Without dead ends: 685 [2024-10-11 05:04:11,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:04:11,003 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1496 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:11,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1389 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:04:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-11 05:04:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 597. [2024-10-11 05:04:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 496 states have (on average 1.5262096774193548) internal successors, (757), 505 states have internal predecessors, (757), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2024-10-11 05:04:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 894 transitions. [2024-10-11 05:04:11,041 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 894 transitions. Word has length 58 [2024-10-11 05:04:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:11,042 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 894 transitions. [2024-10-11 05:04:11,042 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-11 05:04:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 894 transitions. [2024-10-11 05:04:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:11,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:11,044 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-11 05:04:11,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:04:11,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:11,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1070483626, now seen corresponding path program 1 times [2024-10-11 05:04:11,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:11,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298987769] [2024-10-11 05:04:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,133 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-11 05:04:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298987769] [2024-10-11 05:04:11,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298987769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226252448] [2024-10-11 05:04:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:11,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:11,136 INFO L87 Difference]: Start difference. First operand 597 states and 894 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-11 05:04:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:11,805 INFO L93 Difference]: Finished difference Result 1179 states and 1681 transitions. [2024-10-11 05:04:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:11,806 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-11 05:04:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:11,810 INFO L225 Difference]: With dead ends: 1179 [2024-10-11 05:04:11,810 INFO L226 Difference]: Without dead ends: 912 [2024-10-11 05:04:11,811 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-11 05:04:11,812 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1489 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:11,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1100 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-11 05:04:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 858. [2024-10-11 05:04:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 707 states have internal predecessors, (1015), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2024-10-11 05:04:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1244 transitions. [2024-10-11 05:04:11,852 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1244 transitions. Word has length 58 [2024-10-11 05:04:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:11,853 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1244 transitions. [2024-10-11 05:04:11,853 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-11 05:04:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1244 transitions. [2024-10-11 05:04:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:11,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:11,855 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-11 05:04:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:04:11,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -602571652, now seen corresponding path program 1 times [2024-10-11 05:04:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121423804] [2024-10-11 05:04:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,915 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-11 05:04:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121423804] [2024-10-11 05:04:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121423804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:11,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238229413] [2024-10-11 05:04:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:11,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:11,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:11,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:11,917 INFO L87 Difference]: Start difference. First operand 858 states and 1244 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-11 05:04:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:12,634 INFO L93 Difference]: Finished difference Result 1942 states and 2690 transitions. [2024-10-11 05:04:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:04:12,634 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-11 05:04:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:12,644 INFO L225 Difference]: With dead ends: 1942 [2024-10-11 05:04:12,644 INFO L226 Difference]: Without dead ends: 1423 [2024-10-11 05:04:12,646 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-11 05:04:12,649 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1189 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:12,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1131 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-11 05:04:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1269. [2024-10-11 05:04:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1002 states have (on average 1.4121756487025947) internal successors, (1415), 1025 states have internal predecessors, (1415), 147 states have call successors, (147), 94 states have call predecessors, (147), 118 states have return successors, (201), 156 states have call predecessors, (201), 143 states have call successors, (201) [2024-10-11 05:04:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1763 transitions. [2024-10-11 05:04:12,723 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1763 transitions. Word has length 59 [2024-10-11 05:04:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:12,723 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1763 transitions. [2024-10-11 05:04:12,724 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-11 05:04:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1763 transitions. [2024-10-11 05:04:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:04:12,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:12,725 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-11 05:04:12,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:04:12,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 363136743, now seen corresponding path program 1 times [2024-10-11 05:04:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915807491] [2024-10-11 05:04:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,794 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-11 05:04:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915807491] [2024-10-11 05:04:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915807491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:12,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937991004] [2024-10-11 05:04:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:12,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:12,796 INFO L87 Difference]: Start difference. First operand 1269 states and 1763 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-11 05:04:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:13,592 INFO L93 Difference]: Finished difference Result 3229 states and 4326 transitions. [2024-10-11 05:04:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:13,592 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-11 05:04:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:13,601 INFO L225 Difference]: With dead ends: 3229 [2024-10-11 05:04:13,601 INFO L226 Difference]: Without dead ends: 2269 [2024-10-11 05:04:13,603 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-11 05:04:13,603 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 718 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:13,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1328 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2024-10-11 05:04:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2085. [2024-10-11 05:04:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 1620 states have (on average 1.3623456790123456) internal successors, (2207), 1649 states have internal predecessors, (2207), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2024-10-11 05:04:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2787 transitions. [2024-10-11 05:04:13,748 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2787 transitions. Word has length 60 [2024-10-11 05:04:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:13,749 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 2787 transitions. [2024-10-11 05:04:13,749 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-11 05:04:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2787 transitions. [2024-10-11 05:04:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:04:13,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:13,750 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-11 05:04:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:04:13,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash 952697062, now seen corresponding path program 1 times [2024-10-11 05:04:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726317451] [2024-10-11 05:04:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:13,800 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-11 05:04:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726317451] [2024-10-11 05:04:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726317451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:13,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544751494] [2024-10-11 05:04:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:13,802 INFO L87 Difference]: Start difference. First operand 2085 states and 2787 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-11 05:04:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:14,530 INFO L93 Difference]: Finished difference Result 4749 states and 6191 transitions. [2024-10-11 05:04:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-11 05:04:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:14,541 INFO L225 Difference]: With dead ends: 4749 [2024-10-11 05:04:14,541 INFO L226 Difference]: Without dead ends: 2993 [2024-10-11 05:04:14,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:14,546 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1177 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:14,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1143 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-10-11 05:04:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2751. [2024-10-11 05:04:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2122 states have (on average 1.3407163053722904) internal successors, (2845), 2159 states have internal predecessors, (2845), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2024-10-11 05:04:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3614 transitions. [2024-10-11 05:04:14,757 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3614 transitions. Word has length 66 [2024-10-11 05:04:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3614 transitions. [2024-10-11 05:04:14,758 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-11 05:04:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3614 transitions. [2024-10-11 05:04:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:04:14,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:14,760 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-11 05:04:14,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:04:14,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1047983509, now seen corresponding path program 1 times [2024-10-11 05:04:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:14,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941171429] [2024-10-11 05:04:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,851 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-11 05:04:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941171429] [2024-10-11 05:04:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941171429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474509997] [2024-10-11 05:04:14,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:14,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:14,853 INFO L87 Difference]: Start difference. First operand 2751 states and 3614 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-11 05:04:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:15,776 INFO L93 Difference]: Finished difference Result 3471 states and 4491 transitions. [2024-10-11 05:04:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:04:15,777 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-11 05:04:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:15,805 INFO L225 Difference]: With dead ends: 3471 [2024-10-11 05:04:15,806 INFO L226 Difference]: Without dead ends: 3468 [2024-10-11 05:04:15,807 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-11 05:04:15,807 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 2072 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:15,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 862 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-11 05:04:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3201. [2024-10-11 05:04:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2463 states have (on average 1.3288672350791717) internal successors, (3273), 2505 states have internal predecessors, (3273), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2024-10-11 05:04:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4171 transitions. [2024-10-11 05:04:16,105 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4171 transitions. Word has length 67 [2024-10-11 05:04:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:16,105 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4171 transitions. [2024-10-11 05:04:16,105 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-11 05:04:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4171 transitions. [2024-10-11 05:04:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:04:16,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:16,107 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-11 05:04:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:04:16,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1870924240, now seen corresponding path program 1 times [2024-10-11 05:04:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703261239] [2024-10-11 05:04:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,277 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-11 05:04:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703261239] [2024-10-11 05:04:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703261239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443386385] [2024-10-11 05:04:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:16,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:04:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:04:16,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:16,652 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-11 05:04:16,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:04:16,765 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-11 05:04:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443386385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:04:16,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:04:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:04:16,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741119005] [2024-10-11 05:04:16,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:04:16,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:04:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:04:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:16,767 INFO L87 Difference]: Start difference. First operand 3201 states and 4171 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-11 05:04:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:18,618 INFO L93 Difference]: Finished difference Result 7268 states and 9283 transitions. [2024-10-11 05:04:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 05:04:18,619 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-11 05:04:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:18,648 INFO L225 Difference]: With dead ends: 7268 [2024-10-11 05:04:18,648 INFO L226 Difference]: Without dead ends: 7265 [2024-10-11 05:04:18,653 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-11 05:04:18,654 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 2498 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:18,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 1902 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:04:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2024-10-11 05:04:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 4827. [2024-10-11 05:04:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 3703 states have (on average 1.3192006481231433) internal successors, (4885), 3767 states have internal predecessors, (4885), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2024-10-11 05:04:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 6245 transitions. [2024-10-11 05:04:19,103 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 6245 transitions. Word has length 68 [2024-10-11 05:04:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 4827 states and 6245 transitions. [2024-10-11 05:04:19,104 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-11 05:04:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 6245 transitions. [2024-10-11 05:04:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:04:19,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:19,106 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-11 05:04:19,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 05:04:19,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:04:19,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:19,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -600934869, now seen corresponding path program 2 times [2024-10-11 05:04:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848613933] [2024-10-11 05:04:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:19,410 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-11 05:04:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848613933] [2024-10-11 05:04:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848613933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276950338] [2024-10-11 05:04:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:19,415 INFO L87 Difference]: Start difference. First operand 4827 states and 6245 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-11 05:04:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:20,341 INFO L93 Difference]: Finished difference Result 7283 states and 9392 transitions. [2024-10-11 05:04:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:04:20,341 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-11 05:04:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:20,370 INFO L225 Difference]: With dead ends: 7283 [2024-10-11 05:04:20,370 INFO L226 Difference]: Without dead ends: 3580 [2024-10-11 05:04:20,389 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-11 05:04:20,390 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1370 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:20,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 940 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2024-10-11 05:04:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3351. [2024-10-11 05:04:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 2583 states have (on average 1.3073945025164537) internal successors, (3377), 2625 states have internal predecessors, (3377), 387 states have call successors, (387), 308 states have call predecessors, (387), 379 states have return successors, (531), 424 states have call predecessors, (531), 384 states have call successors, (531) [2024-10-11 05:04:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4295 transitions. [2024-10-11 05:04:20,687 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4295 transitions. Word has length 71 [2024-10-11 05:04:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4295 transitions. [2024-10-11 05:04:20,690 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-11 05:04:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4295 transitions. [2024-10-11 05:04:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:04:20,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:20,692 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-11 05:04:20,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:04:20,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -392745723, now seen corresponding path program 1 times [2024-10-11 05:04:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528491225] [2024-10-11 05:04:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,797 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-11 05:04:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528491225] [2024-10-11 05:04:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528491225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490601678] [2024-10-11 05:04:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:20,799 INFO L87 Difference]: Start difference. First operand 3351 states and 4295 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-11 05:04:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:22,411 INFO L93 Difference]: Finished difference Result 9649 states and 12138 transitions. [2024-10-11 05:04:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:04:22,411 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-11 05:04:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:22,429 INFO L225 Difference]: With dead ends: 9649 [2024-10-11 05:04:22,429 INFO L226 Difference]: Without dead ends: 5412 [2024-10-11 05:04:22,436 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-11 05:04:22,437 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1243 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:22,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1722 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2024-10-11 05:04:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5092. [2024-10-11 05:04:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 3867 states have (on average 1.273855702094647) internal successors, (4926), 3952 states have internal predecessors, (4926), 591 states have call successors, (591), 482 states have call predecessors, (591), 632 states have return successors, (913), 664 states have call predecessors, (913), 588 states have call successors, (913) [2024-10-11 05:04:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 6430 transitions. [2024-10-11 05:04:22,838 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 6430 transitions. Word has length 76 [2024-10-11 05:04:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:22,838 INFO L471 AbstractCegarLoop]: Abstraction has 5092 states and 6430 transitions. [2024-10-11 05:04:22,838 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-11 05:04:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 6430 transitions. [2024-10-11 05:04:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:04:22,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:22,842 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-11 05:04:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:04:22,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1057621740, now seen corresponding path program 1 times [2024-10-11 05:04:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362630083] [2024-10-11 05:04:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,954 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-11 05:04:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362630083] [2024-10-11 05:04:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362630083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:22,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908040618] [2024-10-11 05:04:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:22,956 INFO L87 Difference]: Start difference. First operand 5092 states and 6430 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-11 05:04:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:24,444 INFO L93 Difference]: Finished difference Result 8763 states and 10938 transitions. [2024-10-11 05:04:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:04:24,445 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-11 05:04:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:24,472 INFO L225 Difference]: With dead ends: 8763 [2024-10-11 05:04:24,472 INFO L226 Difference]: Without dead ends: 4583 [2024-10-11 05:04:24,480 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-11 05:04:24,481 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1742 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:24,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1727 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2024-10-11 05:04:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4249. [2024-10-11 05:04:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 3237 states have (on average 1.2684584491813407) internal successors, (4106), 3304 states have internal predecessors, (4106), 492 states have call successors, (492), 397 states have call predecessors, (492), 518 states have return successors, (691), 554 states have call predecessors, (691), 489 states have call successors, (691) [2024-10-11 05:04:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 5289 transitions. [2024-10-11 05:04:24,906 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 5289 transitions. Word has length 86 [2024-10-11 05:04:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:24,906 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 5289 transitions. [2024-10-11 05:04:24,907 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-11 05:04:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 5289 transitions. [2024-10-11 05:04:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:04:24,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:24,913 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-11 05:04:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:04:24,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:24,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 702791445, now seen corresponding path program 1 times [2024-10-11 05:04:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:24,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924565901] [2024-10-11 05:04:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:04:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:04:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:04:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:04:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:04:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:04:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,084 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-11 05:04:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:25,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924565901] [2024-10-11 05:04:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924565901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:25,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228006863] [2024-10-11 05:04:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:25,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:25,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:04:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:25,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:04:25,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:25,271 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-11 05:04:25,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228006863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:04:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005592085] [2024-10-11 05:04:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:25,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:04:25,275 INFO L87 Difference]: Start difference. First operand 4249 states and 5289 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-11 05:04:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:25,617 INFO L93 Difference]: Finished difference Result 6096 states and 7542 transitions. [2024-10-11 05:04:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:04:25,617 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-11 05:04:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:25,626 INFO L225 Difference]: With dead ends: 6096 [2024-10-11 05:04:25,627 INFO L226 Difference]: Without dead ends: 2180 [2024-10-11 05:04:25,632 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-11 05:04:25,632 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:25,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2848 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:04:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-11 05:04:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-11 05:04:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1745 states have (on average 1.287679083094556) internal successors, (2247), 1761 states have internal predecessors, (2247), 216 states have call successors, (216), 163 states have call predecessors, (216), 217 states have return successors, (298), 256 states have call predecessors, (298), 213 states have call successors, (298) [2024-10-11 05:04:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2761 transitions. [2024-10-11 05:04:25,766 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2761 transitions. Word has length 131 [2024-10-11 05:04:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 2761 transitions. [2024-10-11 05:04:25,767 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-11 05:04:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2761 transitions. [2024-10-11 05:04:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:04:25,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:25,771 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-11 05:04:25,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:04:25,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 05:04:25,972 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:25,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1600186653, now seen corresponding path program 1 times [2024-10-11 05:04:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993914139] [2024-10-11 05:04:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 05:04:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:04:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 05:04:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:04:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,045 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-11 05:04:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993914139] [2024-10-11 05:04:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993914139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048217844] [2024-10-11 05:04:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:26,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:26,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:26,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:26,047 INFO L87 Difference]: Start difference. First operand 2180 states and 2761 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-11 05:04:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:26,745 INFO L93 Difference]: Finished difference Result 2245 states and 2829 transitions. [2024-10-11 05:04:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:26,745 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-11 05:04:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:26,753 INFO L225 Difference]: With dead ends: 2245 [2024-10-11 05:04:26,753 INFO L226 Difference]: Without dead ends: 1843 [2024-10-11 05:04:26,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:26,755 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 639 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:26,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1281 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-11 05:04:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1781. [2024-10-11 05:04:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1442 states have (on average 1.3065187239944522) internal successors, (1884), 1455 states have internal predecessors, (1884), 170 states have call successors, (170), 123 states have call predecessors, (170), 167 states have return successors, (234), 203 states have call predecessors, (234), 167 states have call successors, (234) [2024-10-11 05:04:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2288 transitions. [2024-10-11 05:04:26,904 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2288 transitions. Word has length 133 [2024-10-11 05:04:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:26,904 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2288 transitions. [2024-10-11 05:04:26,905 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-11 05:04:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2288 transitions. [2024-10-11 05:04:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:04:26,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:26,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:26,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:04:26,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1706471398, now seen corresponding path program 1 times [2024-10-11 05:04:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169799111] [2024-10-11 05:04:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:04:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:04:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:04:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 05:04:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169799111] [2024-10-11 05:04:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169799111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718763921] [2024-10-11 05:04:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:27,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:27,046 INFO L87 Difference]: Start difference. First operand 1781 states and 2288 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:04:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:27,888 INFO L93 Difference]: Finished difference Result 3128 states and 3957 transitions. [2024-10-11 05:04:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:04:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-11 05:04:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:27,896 INFO L225 Difference]: With dead ends: 3128 [2024-10-11 05:04:27,896 INFO L226 Difference]: Without dead ends: 1888 [2024-10-11 05:04:27,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:27,898 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 834 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:27,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1424 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-10-11 05:04:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1706. [2024-10-11 05:04:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1389 states have (on average 1.306695464362851) internal successors, (1815), 1403 states have internal predecessors, (1815), 161 states have call successors, (161), 118 states have call predecessors, (161), 154 states have return successors, (218), 185 states have call predecessors, (218), 158 states have call successors, (218) [2024-10-11 05:04:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2194 transitions. [2024-10-11 05:04:27,998 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2194 transitions. Word has length 145 [2024-10-11 05:04:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:27,999 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2194 transitions. [2024-10-11 05:04:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:04:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2194 transitions. [2024-10-11 05:04:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:04:28,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:28,002 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:04:28,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:28,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1034542947, now seen corresponding path program 1 times [2024-10-11 05:04:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596225762] [2024-10-11 05:04:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:04:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:04:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:04:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:04:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:04:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 05:04:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596225762] [2024-10-11 05:04:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596225762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572605930] [2024-10-11 05:04:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:28,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:04:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:04:28,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:04:28,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:04:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 05:04:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572605930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:04:28,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:04:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 05:04:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012299178] [2024-10-11 05:04:28,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:04:28,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 05:04:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 05:04:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:04:28,695 INFO L87 Difference]: Start difference. First operand 1706 states and 2194 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:04:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:29,990 INFO L93 Difference]: Finished difference Result 3513 states and 4482 transitions. [2024-10-11 05:04:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 05:04:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-11 05:04:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:29,997 INFO L225 Difference]: With dead ends: 3513 [2024-10-11 05:04:29,997 INFO L226 Difference]: Without dead ends: 2211 [2024-10-11 05:04:29,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 05:04:30,000 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1438 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:30,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1821 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2024-10-11 05:04:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2067. [2024-10-11 05:04:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1638 states have (on average 1.2753357753357752) internal successors, (2089), 1660 states have internal predecessors, (2089), 215 states have call successors, (215), 168 states have call predecessors, (215), 212 states have return successors, (332), 239 states have call predecessors, (332), 212 states have call successors, (332) [2024-10-11 05:04:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2636 transitions. [2024-10-11 05:04:30,139 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2636 transitions. Word has length 147 [2024-10-11 05:04:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:30,140 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2636 transitions. [2024-10-11 05:04:30,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:04:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2636 transitions. [2024-10-11 05:04:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:30,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:30,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:30,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:04:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:30,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:30,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1939723724, now seen corresponding path program 1 times [2024-10-11 05:04:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129634477] [2024-10-11 05:04:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:30,487 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-11 05:04:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129634477] [2024-10-11 05:04:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129634477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:04:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130462090] [2024-10-11 05:04:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:30,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:04:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:04:30,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:04:30,490 INFO L87 Difference]: Start difference. First operand 2067 states and 2636 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:32,034 INFO L93 Difference]: Finished difference Result 2476 states and 3317 transitions. [2024-10-11 05:04:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:32,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2024-10-11 05:04:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:32,046 INFO L225 Difference]: With dead ends: 2476 [2024-10-11 05:04:32,046 INFO L226 Difference]: Without dead ends: 2177 [2024-10-11 05:04:32,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:32,049 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 939 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:32,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 773 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2024-10-11 05:04:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2067. [2024-10-11 05:04:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1638 states have (on average 1.2747252747252746) internal successors, (2088), 1660 states have internal predecessors, (2088), 215 states have call successors, (215), 168 states have call predecessors, (215), 212 states have return successors, (332), 239 states have call predecessors, (332), 212 states have call successors, (332) [2024-10-11 05:04:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2635 transitions. [2024-10-11 05:04:32,482 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2635 transitions. Word has length 142 [2024-10-11 05:04:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:32,483 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2635 transitions. [2024-10-11 05:04:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2635 transitions. [2024-10-11 05:04:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:32,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:32,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:32,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:04:32,487 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2066424182, now seen corresponding path program 1 times [2024-10-11 05:04:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947677374] [2024-10-11 05:04:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,671 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-11 05:04:32,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947677374] [2024-10-11 05:04:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947677374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:32,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502438787] [2024-10-11 05:04:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:32,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:32,674 INFO L87 Difference]: Start difference. First operand 2067 states and 2635 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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-11 05:04:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:35,251 INFO L93 Difference]: Finished difference Result 2884 states and 3997 transitions. [2024-10-11 05:04:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:35,259 INFO L225 Difference]: With dead ends: 2884 [2024-10-11 05:04:35,259 INFO L226 Difference]: Without dead ends: 2593 [2024-10-11 05:04:35,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:35,260 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1474 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:35,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1143 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:04:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2024-10-11 05:04:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2372. [2024-10-11 05:04:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1917 states have (on average 1.3291601460615545) internal successors, (2548), 1940 states have internal predecessors, (2548), 234 states have call successors, (234), 174 states have call predecessors, (234), 219 states have return successors, (354), 258 states have call predecessors, (354), 231 states have call successors, (354) [2024-10-11 05:04:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3136 transitions. [2024-10-11 05:04:35,566 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3136 transitions. Word has length 142 [2024-10-11 05:04:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:35,567 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3136 transitions. [2024-10-11 05:04:35,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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-11 05:04:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3136 transitions. [2024-10-11 05:04:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:35,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:35,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:35,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:04:35,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1556450486, now seen corresponding path program 1 times [2024-10-11 05:04:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065620311] [2024-10-11 05:04:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,771 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-11 05:04:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065620311] [2024-10-11 05:04:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065620311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:35,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609435061] [2024-10-11 05:04:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:35,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:35,773 INFO L87 Difference]: Start difference. First operand 2372 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:38,836 INFO L93 Difference]: Finished difference Result 3619 states and 5215 transitions. [2024-10-11 05:04:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:38,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:38,846 INFO L225 Difference]: With dead ends: 3619 [2024-10-11 05:04:38,846 INFO L226 Difference]: Without dead ends: 3023 [2024-10-11 05:04:38,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:38,848 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1499 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:38,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2057 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3449 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:04:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2024-10-11 05:04:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2654. [2024-10-11 05:04:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2173 states have (on average 1.3630924988495168) internal successors, (2962), 2197 states have internal predecessors, (2962), 253 states have call successors, (253), 180 states have call predecessors, (253), 226 states have return successors, (375), 278 states have call predecessors, (375), 250 states have call successors, (375) [2024-10-11 05:04:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3590 transitions. [2024-10-11 05:04:39,214 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3590 transitions. Word has length 142 [2024-10-11 05:04:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:39,214 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 3590 transitions. [2024-10-11 05:04:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3590 transitions. [2024-10-11 05:04:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:39,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:39,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:39,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:04:39,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -493958412, now seen corresponding path program 1 times [2024-10-11 05:04:39,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668101835] [2024-10-11 05:04:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,465 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-11 05:04:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668101835] [2024-10-11 05:04:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668101835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:39,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186176925] [2024-10-11 05:04:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:39,469 INFO L87 Difference]: Start difference. First operand 2654 states and 3590 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:43,101 INFO L93 Difference]: Finished difference Result 4696 states and 6989 transitions. [2024-10-11 05:04:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:43,115 INFO L225 Difference]: With dead ends: 4696 [2024-10-11 05:04:43,116 INFO L226 Difference]: Without dead ends: 3818 [2024-10-11 05:04:43,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:43,120 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1497 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3445 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:43,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 2055 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3445 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 05:04:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-11 05:04:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3219. [2024-10-11 05:04:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4113924050632911) internal successors, (3791), 2712 states have internal predecessors, (3791), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-11 05:04:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4503 transitions. [2024-10-11 05:04:43,534 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4503 transitions. Word has length 142 [2024-10-11 05:04:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:43,535 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4503 transitions. [2024-10-11 05:04:43,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4503 transitions. [2024-10-11 05:04:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:43,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:43,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:43,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:04:43,539 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:43,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash -5911306, now seen corresponding path program 1 times [2024-10-11 05:04:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660916643] [2024-10-11 05:04:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,722 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-11 05:04:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660916643] [2024-10-11 05:04:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660916643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:43,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:43,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983116415] [2024-10-11 05:04:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:43,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:43,724 INFO L87 Difference]: Start difference. First operand 3219 states and 4503 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:45,574 INFO L93 Difference]: Finished difference Result 5249 states and 7893 transitions. [2024-10-11 05:04:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:45,587 INFO L225 Difference]: With dead ends: 5249 [2024-10-11 05:04:45,588 INFO L226 Difference]: Without dead ends: 3806 [2024-10-11 05:04:45,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:45,592 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1135 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:45,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1159 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2024-10-11 05:04:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3219. [2024-10-11 05:04:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4095309009679822) internal successors, (3786), 2712 states have internal predecessors, (3786), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-11 05:04:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4498 transitions. [2024-10-11 05:04:45,958 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4498 transitions. Word has length 142 [2024-10-11 05:04:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:45,958 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4498 transitions. [2024-10-11 05:04:45,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4498 transitions. [2024-10-11 05:04:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:45,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:45,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:45,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:04:45,962 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:45,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1098546508, now seen corresponding path program 1 times [2024-10-11 05:04:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:45,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053060748] [2024-10-11 05:04:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,192 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-11 05:04:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053060748] [2024-10-11 05:04:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053060748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446465913] [2024-10-11 05:04:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:46,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:46,194 INFO L87 Difference]: Start difference. First operand 3219 states and 4498 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:48,048 INFO L93 Difference]: Finished difference Result 5243 states and 7867 transitions. [2024-10-11 05:04:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:48,059 INFO L225 Difference]: With dead ends: 5243 [2024-10-11 05:04:48,059 INFO L226 Difference]: Without dead ends: 3800 [2024-10-11 05:04:48,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:48,066 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1203 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:48,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1158 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2024-10-11 05:04:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3219. [2024-10-11 05:04:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4076693968726732) internal successors, (3781), 2712 states have internal predecessors, (3781), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-11 05:04:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4493 transitions. [2024-10-11 05:04:48,424 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4493 transitions. Word has length 142 [2024-10-11 05:04:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:48,424 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4493 transitions. [2024-10-11 05:04:48,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4493 transitions. [2024-10-11 05:04:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:48,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:48,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:04:48,428 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1914248502, now seen corresponding path program 1 times [2024-10-11 05:04:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98666595] [2024-10-11 05:04:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:48,631 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-11 05:04:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98666595] [2024-10-11 05:04:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98666595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393729012] [2024-10-11 05:04:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:48,634 INFO L87 Difference]: Start difference. First operand 3219 states and 4493 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:50,343 INFO L93 Difference]: Finished difference Result 5236 states and 7839 transitions. [2024-10-11 05:04:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:50,357 INFO L225 Difference]: With dead ends: 5236 [2024-10-11 05:04:50,357 INFO L226 Difference]: Without dead ends: 3793 [2024-10-11 05:04:50,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:50,362 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1315 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:50,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 966 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:04:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2024-10-11 05:04:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3219. [2024-10-11 05:04:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.405807892777364) internal successors, (3776), 2712 states have internal predecessors, (3776), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-11 05:04:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4488 transitions. [2024-10-11 05:04:50,812 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4488 transitions. Word has length 142 [2024-10-11 05:04:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:50,812 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4488 transitions. [2024-10-11 05:04:50,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4488 transitions. [2024-10-11 05:04:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:50,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:50,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:04:50,816 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 71772788, now seen corresponding path program 1 times [2024-10-11 05:04:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24260917] [2024-10-11 05:04:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,037 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-11 05:04:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24260917] [2024-10-11 05:04:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24260917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188094140] [2024-10-11 05:04:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:51,039 INFO L87 Difference]: Start difference. First operand 3219 states and 4488 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:53,070 INFO L93 Difference]: Finished difference Result 5224 states and 7801 transitions. [2024-10-11 05:04:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:53,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:53,086 INFO L225 Difference]: With dead ends: 5224 [2024-10-11 05:04:53,087 INFO L226 Difference]: Without dead ends: 3781 [2024-10-11 05:04:53,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:53,093 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1133 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:53,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1159 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:04:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2024-10-11 05:04:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3219. [2024-10-11 05:04:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4039463886820551) internal successors, (3771), 2712 states have internal predecessors, (3771), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-11 05:04:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4483 transitions. [2024-10-11 05:04:53,660 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4483 transitions. Word has length 142 [2024-10-11 05:04:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:53,660 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4483 transitions. [2024-10-11 05:04:53,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4483 transitions. [2024-10-11 05:04:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:53,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:53,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:53,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:04:53,667 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -260870350, now seen corresponding path program 1 times [2024-10-11 05:04:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58723742] [2024-10-11 05:04:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,886 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-11 05:04:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58723742] [2024-10-11 05:04:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58723742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:53,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529253920] [2024-10-11 05:04:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:53,888 INFO L87 Difference]: Start difference. First operand 3219 states and 4483 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:57,131 INFO L93 Difference]: Finished difference Result 6728 states and 10220 transitions. [2024-10-11 05:04:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:04:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:57,146 INFO L225 Difference]: With dead ends: 6728 [2024-10-11 05:04:57,146 INFO L226 Difference]: Without dead ends: 5285 [2024-10-11 05:04:57,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:57,150 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1468 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:57,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 2055 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:04:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-10-11 05:04:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 4372. [2024-10-11 05:04:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 3735 states have (on average 1.4575635876840696) internal successors, (5444), 3765 states have internal predecessors, (5444), 367 states have call successors, (367), 216 states have call predecessors, (367), 268 states have return successors, (519), 398 states have call predecessors, (519), 364 states have call successors, (519) [2024-10-11 05:04:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 6330 transitions. [2024-10-11 05:04:57,626 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 6330 transitions. Word has length 142 [2024-10-11 05:04:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:57,626 INFO L471 AbstractCegarLoop]: Abstraction has 4372 states and 6330 transitions. [2024-10-11 05:04:57,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:04:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 6330 transitions. [2024-10-11 05:04:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:04:57,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:57,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:04:57,630 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:57,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1668061876, now seen corresponding path program 1 times [2024-10-11 05:04:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730751789] [2024-10-11 05:04:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:04:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:04:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,790 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-11 05:04:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730751789] [2024-10-11 05:04:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730751789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:57,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:57,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209803009] [2024-10-11 05:04:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:57,791 INFO L87 Difference]: Start difference. First operand 4372 states and 6330 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:01,080 INFO L93 Difference]: Finished difference Result 10857 states and 16919 transitions. [2024-10-11 05:05:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:01,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:05:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:01,105 INFO L225 Difference]: With dead ends: 10857 [2024-10-11 05:05:01,105 INFO L226 Difference]: Without dead ends: 8261 [2024-10-11 05:05:01,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:01,113 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1467 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:01,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2055 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:05:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2024-10-11 05:05:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 6675. [2024-10-11 05:05:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6675 states, 5830 states have (on average 1.5060034305317325) internal successors, (8780), 5868 states have internal predecessors, (8780), 519 states have call successors, (519), 264 states have call predecessors, (519), 324 states have return successors, (733), 558 states have call predecessors, (733), 516 states have call successors, (733) [2024-10-11 05:05:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6675 states to 6675 states and 10032 transitions. [2024-10-11 05:05:01,754 INFO L78 Accepts]: Start accepts. Automaton has 6675 states and 10032 transitions. Word has length 142 [2024-10-11 05:05:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 6675 states and 10032 transitions. [2024-10-11 05:05:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6675 states and 10032 transitions. [2024-10-11 05:05:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:05:01,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:01,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:05:01,760 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -625019150, now seen corresponding path program 1 times [2024-10-11 05:05:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717366699] [2024-10-11 05:05:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:05:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:05:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:05:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,935 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-11 05:05:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717366699] [2024-10-11 05:05:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717366699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:01,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:01,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983628661] [2024-10-11 05:05:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:01,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:01,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:01,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:01,937 INFO L87 Difference]: Start difference. First operand 6675 states and 10032 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:05,967 INFO L93 Difference]: Finished difference Result 19106 states and 30359 transitions. [2024-10-11 05:05:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:05,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:05:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:06,004 INFO L225 Difference]: With dead ends: 19106 [2024-10-11 05:05:06,004 INFO L226 Difference]: Without dead ends: 14207 [2024-10-11 05:05:06,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:06,019 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1466 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3289 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:06,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 2055 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3289 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 05:05:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2024-10-11 05:05:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 11296. [2024-10-11 05:05:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11296 states, 10035 states have (on average 1.5420029895366218) internal successors, (15474), 10089 states have internal predecessors, (15474), 823 states have call successors, (823), 360 states have call predecessors, (823), 436 states have return successors, (1215), 878 states have call predecessors, (1215), 820 states have call successors, (1215) [2024-10-11 05:05:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11296 states to 11296 states and 17512 transitions. [2024-10-11 05:05:07,202 INFO L78 Accepts]: Start accepts. Automaton has 11296 states and 17512 transitions. Word has length 142 [2024-10-11 05:05:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:07,202 INFO L471 AbstractCegarLoop]: Abstraction has 11296 states and 17512 transitions. [2024-10-11 05:05:07,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11296 states and 17512 transitions. [2024-10-11 05:05:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:05:07,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:07,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:05:07,209 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:07,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1102125812, now seen corresponding path program 1 times [2024-10-11 05:05:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546325393] [2024-10-11 05:05:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:05:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:05:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:05:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,474 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-11 05:05:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546325393] [2024-10-11 05:05:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546325393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:07,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:07,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763580365] [2024-10-11 05:05:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:07,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:07,475 INFO L87 Difference]: Start difference. First operand 11296 states and 17512 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:12,520 INFO L93 Difference]: Finished difference Result 39701 states and 64059 transitions. [2024-10-11 05:05:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:05:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:05:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:12,599 INFO L225 Difference]: With dead ends: 39701 [2024-10-11 05:05:12,599 INFO L226 Difference]: Without dead ends: 30181 [2024-10-11 05:05:12,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:05:12,623 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1557 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 3868 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:12,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 2048 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3868 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 05:05:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30181 states. [2024-10-11 05:05:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30181 to 20505. [2024-10-11 05:05:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20505 states, 18444 states have (on average 1.5656039904576013) internal successors, (28876), 18530 states have internal predecessors, (28876), 1399 states have call successors, (1399), 552 states have call predecessors, (1399), 660 states have return successors, (2309), 1486 states have call predecessors, (2309), 1396 states have call successors, (2309) [2024-10-11 05:05:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20505 states to 20505 states and 32584 transitions. [2024-10-11 05:05:14,495 INFO L78 Accepts]: Start accepts. Automaton has 20505 states and 32584 transitions. Word has length 142 [2024-10-11 05:05:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:14,496 INFO L471 AbstractCegarLoop]: Abstraction has 20505 states and 32584 transitions. [2024-10-11 05:05:14,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20505 states and 32584 transitions. [2024-10-11 05:05:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:05:14,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:14,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:14,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:05:14,510 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:14,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1573482162, now seen corresponding path program 1 times [2024-10-11 05:05:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49606252] [2024-10-11 05:05:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:05:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:05:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:05:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:14,751 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-11 05:05:14,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49606252] [2024-10-11 05:05:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49606252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764874299] [2024-10-11 05:05:14,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:14,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:14,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:14,753 INFO L87 Difference]: Start difference. First operand 20505 states and 32584 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:20,956 INFO L93 Difference]: Finished difference Result 75900 states and 123993 transitions. [2024-10-11 05:05:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:05:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 05:05:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:21,119 INFO L225 Difference]: With dead ends: 75900 [2024-10-11 05:05:21,119 INFO L226 Difference]: Without dead ends: 57171 [2024-10-11 05:05:21,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:05:21,169 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1872 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 1472 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:05:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57171 states. [2024-10-11 05:05:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57171 to 38282. [2024-10-11 05:05:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38282 states, 34653 states have (on average 1.5753325830375438) internal successors, (54590), 34803 states have internal predecessors, (54590), 2519 states have call successors, (2519), 936 states have call predecessors, (2519), 1108 states have return successors, (4951), 2670 states have call predecessors, (4951), 2516 states have call successors, (4951) [2024-10-11 05:05:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38282 states to 38282 states and 62060 transitions. [2024-10-11 05:05:24,770 INFO L78 Accepts]: Start accepts. Automaton has 38282 states and 62060 transitions. Word has length 142 [2024-10-11 05:05:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:24,770 INFO L471 AbstractCegarLoop]: Abstraction has 38282 states and 62060 transitions. [2024-10-11 05:05:24,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-11 05:05:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38282 states and 62060 transitions. [2024-10-11 05:05:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:05:24,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:24,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:24,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:05:24,788 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:24,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash -73880780, now seen corresponding path program 1 times [2024-10-11 05:05:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:24,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441387985] [2024-10-11 05:05:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:05:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:05:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:05:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,152 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-11 05:05:25,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:25,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441387985] [2024-10-11 05:05:25,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441387985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:25,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:25,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499587114] [2024-10-11 05:05:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:25,155 INFO L87 Difference]: Start difference. First operand 38282 states and 62060 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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)