./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_3.cil+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:12:38,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:12:38,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:12:38,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:12:38,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:12:38,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:12:38,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:12:38,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:12:38,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:12:38,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:12:38,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:12:38,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:12:38,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:12:38,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:12:38,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:12:38,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:12:38,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:12:38,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:12:38,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:12:38,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:12:38,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:12:38,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:12:38,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:12:38,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:12:38,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:12:38,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:12:38,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:12:38,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:12:38,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:12:38,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:12:38,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:12:38,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:12:38,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:12:38,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:12:38,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:12:38,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:12:38,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:12:38,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:12:38,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:12:38,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:12:38,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:12:38,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:12:38,250 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 [2024-11-20 00:12:38,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:12:38,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:12:38,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:12:38,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:12:38,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:12:38,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-20 00:12:39,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:12:40,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:12:40,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-20 00:12:40,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4883d3f8/1bd45c25f9c94469a42dc267e82973a7/FLAG9205cb136 [2024-11-20 00:12:40,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4883d3f8/1bd45c25f9c94469a42dc267e82973a7 [2024-11-20 00:12:40,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:12:40,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:12:40,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:12:40,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:12:40,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:12:40,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:40,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2effd3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40, skipping insertion in model container [2024-11-20 00:12:40,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:40,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:12:40,553 WARN L250 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_3.cil+token_ring.14.cil.c[911,924] [2024-11-20 00:12:40,618 WARN L250 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_3.cil+token_ring.14.cil.c[8416,8429] [2024-11-20 00:12:40,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:12:40,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:12:40,790 WARN L250 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_3.cil+token_ring.14.cil.c[911,924] [2024-11-20 00:12:40,811 WARN L250 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_3.cil+token_ring.14.cil.c[8416,8429] [2024-11-20 00:12:40,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:12:40,902 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:12:40,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40 WrapperNode [2024-11-20 00:12:40,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:12:40,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:12:40,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:12:40,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:12:40,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:40,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:40,981 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1110 [2024-11-20 00:12:40,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:12:40,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:12:40,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:12:40,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:12:40,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:40,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,022 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-11-20 00:12:41,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:12:41,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:12:41,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:12:41,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:12:41,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (1/1) ... [2024-11-20 00:12:41,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:12:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:12:41,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 00:12:41,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 00:12:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:12:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:12:41,181 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:12:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:12:41,182 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:12:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:12:41,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:12:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:12:41,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:12:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:12:41,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:12:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:12:41,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:12:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:12:41,184 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:12:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:12:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:12:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:12:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:12:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:12:41,186 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:12:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:12:41,186 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:12:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:12:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:12:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:12:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:12:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:12:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:12:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:12:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:12:41,188 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:12:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:12:41,188 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:12:41,352 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:12:41,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:12:42,342 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-20 00:12:42,343 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-20 00:12:42,605 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-20 00:12:42,605 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:12:42,631 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:12:42,632 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-20 00:12:42,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:42 BoogieIcfgContainer [2024-11-20 00:12:42,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:12:42,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:12:42,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:12:42,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:12:42,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:12:40" (1/3) ... [2024-11-20 00:12:42,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbd2486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:42, skipping insertion in model container [2024-11-20 00:12:42,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:40" (2/3) ... [2024-11-20 00:12:42,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbd2486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:42, skipping insertion in model container [2024-11-20 00:12:42,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:42" (3/3) ... [2024-11-20 00:12:42,641 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-20 00:12:42,658 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:12:42,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:12:42,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:12:42,767 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;@4533712b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:12:42,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:12:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 456 states have (on average 1.6228070175438596) internal successors, (740), 464 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 00:12:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:12:42,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:42,792 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] [2024-11-20 00:12:42,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:42,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1702090679, now seen corresponding path program 1 times [2024-11-20 00:12:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050000182] [2024-11-20 00:12:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:12:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:12:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050000182] [2024-11-20 00:12:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050000182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:12:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609472099] [2024-11-20 00:12:43,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:12:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:12:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:12:43,309 INFO L87 Difference]: Start difference. First operand has 518 states, 456 states have (on average 1.6228070175438596) internal successors, (740), 464 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:12:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:44,490 INFO L93 Difference]: Finished difference Result 1025 states and 1636 transitions. [2024-11-20 00:12:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 00:12:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:12:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:44,511 INFO L225 Difference]: With dead ends: 1025 [2024-11-20 00:12:44,512 INFO L226 Difference]: Without dead ends: 525 [2024-11-20 00:12:44,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:12:44,525 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 792 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:44,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1864 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:12:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-20 00:12:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 507. [2024-11-20 00:12:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 448 states have (on average 1.5379464285714286) internal successors, (689), 453 states have internal predecessors, (689), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 00:12:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 773 transitions. [2024-11-20 00:12:44,635 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 773 transitions. Word has length 65 [2024-11-20 00:12:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:44,636 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 773 transitions. [2024-11-20 00:12:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:12:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 773 transitions. [2024-11-20 00:12:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:12:44,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:44,641 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] [2024-11-20 00:12:44,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:12:44,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:44,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1206091207, now seen corresponding path program 1 times [2024-11-20 00:12:44,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814405787] [2024-11-20 00:12:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:12:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:12:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:44,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:44,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814405787] [2024-11-20 00:12:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814405787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:44,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:12:44,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286218949] [2024-11-20 00:12:44,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:12:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:12:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:12:44,921 INFO L87 Difference]: Start difference. First operand 507 states and 773 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 00:12:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:46,283 INFO L93 Difference]: Finished difference Result 762 states and 1142 transitions. [2024-11-20 00:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:12:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-20 00:12:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:46,288 INFO L225 Difference]: With dead ends: 762 [2024-11-20 00:12:46,289 INFO L226 Difference]: Without dead ends: 658 [2024-11-20 00:12:46,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:12:46,291 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 912 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:46,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2268 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:12:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-20 00:12:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 619. [2024-11-20 00:12:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 538 states have (on average 1.5148698884758365) internal successors, (815), 545 states have internal predecessors, (815), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-20 00:12:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 930 transitions. [2024-11-20 00:12:46,338 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 930 transitions. Word has length 65 [2024-11-20 00:12:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 930 transitions. [2024-11-20 00:12:46,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 00:12:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 930 transitions. [2024-11-20 00:12:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:12:46,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:46,342 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] [2024-11-20 00:12:46,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:12:46,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:46,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1409987449, now seen corresponding path program 1 times [2024-11-20 00:12:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:46,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608891500] [2024-11-20 00:12:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:12:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:12:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608891500] [2024-11-20 00:12:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608891500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:46,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:12:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229043408] [2024-11-20 00:12:46,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:12:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:12:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:12:46,547 INFO L87 Difference]: Start difference. First operand 619 states and 930 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-20 00:12:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:48,116 INFO L93 Difference]: Finished difference Result 1016 states and 1495 transitions. [2024-11-20 00:12:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:12:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-20 00:12:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:48,122 INFO L225 Difference]: With dead ends: 1016 [2024-11-20 00:12:48,122 INFO L226 Difference]: Without dead ends: 807 [2024-11-20 00:12:48,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:12:48,124 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1488 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:48,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 2644 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:12:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-20 00:12:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 731. [2024-11-20 00:12:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 628 states have (on average 1.4968152866242037) internal successors, (940), 637 states have internal predecessors, (940), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2024-11-20 00:12:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1089 transitions. [2024-11-20 00:12:48,171 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1089 transitions. Word has length 65 [2024-11-20 00:12:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:48,171 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1089 transitions. [2024-11-20 00:12:48,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-20 00:12:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1089 transitions. [2024-11-20 00:12:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:12:48,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:48,175 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] [2024-11-20 00:12:48,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:12:48,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:48,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 856393737, now seen corresponding path program 1 times [2024-11-20 00:12:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128600654] [2024-11-20 00:12:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:12:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:12:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128600654] [2024-11-20 00:12:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128600654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809737800] [2024-11-20 00:12:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:48,319 INFO L87 Difference]: Start difference. First operand 731 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:12:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:49,608 INFO L93 Difference]: Finished difference Result 1403 states and 2031 transitions. [2024-11-20 00:12:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:12:49,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-20 00:12:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:49,615 INFO L225 Difference]: With dead ends: 1403 [2024-11-20 00:12:49,616 INFO L226 Difference]: Without dead ends: 1088 [2024-11-20 00:12:49,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:12:49,618 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 1598 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:49,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2098 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:12:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-20 00:12:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1012. [2024-11-20 00:12:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 854 states have (on average 1.4601873536299765) internal successors, (1247), 867 states have internal predecessors, (1247), 100 states have call successors, (100), 50 states have call predecessors, (100), 56 states have return successors, (117), 98 states have call predecessors, (117), 96 states have call successors, (117) [2024-11-20 00:12:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1464 transitions. [2024-11-20 00:12:49,680 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1464 transitions. Word has length 65 [2024-11-20 00:12:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:49,681 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1464 transitions. [2024-11-20 00:12:49,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:12:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1464 transitions. [2024-11-20 00:12:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:12:49,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:49,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:12:49,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:12:49,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 323657818, now seen corresponding path program 1 times [2024-11-20 00:12:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053991656] [2024-11-20 00:12:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:12:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:12:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053991656] [2024-11-20 00:12:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053991656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:12:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914298360] [2024-11-20 00:12:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:12:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:12:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:12:49,856 INFO L87 Difference]: Start difference. First operand 1012 states and 1464 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-20 00:12:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:51,175 INFO L93 Difference]: Finished difference Result 1680 states and 2391 transitions. [2024-11-20 00:12:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:12:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-20 00:12:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:51,182 INFO L225 Difference]: With dead ends: 1680 [2024-11-20 00:12:51,182 INFO L226 Difference]: Without dead ends: 1084 [2024-11-20 00:12:51,184 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-11-20 00:12:51,185 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 666 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:51,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 3117 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:12:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-20 00:12:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1027. [2024-11-20 00:12:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 866 states have (on average 1.4503464203233256) internal successors, (1256), 879 states have internal predecessors, (1256), 100 states have call successors, (100), 50 states have call predecessors, (100), 59 states have return successors, (120), 101 states have call predecessors, (120), 96 states have call successors, (120) [2024-11-20 00:12:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1476 transitions. [2024-11-20 00:12:51,244 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1476 transitions. Word has length 66 [2024-11-20 00:12:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1476 transitions. [2024-11-20 00:12:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-20 00:12:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1476 transitions. [2024-11-20 00:12:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:12:51,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:51,247 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-11-20 00:12:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:12:51,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -705701480, now seen corresponding path program 1 times [2024-11-20 00:12:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656190237] [2024-11-20 00:12:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:12:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:12:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:51,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656190237] [2024-11-20 00:12:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656190237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:51,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:51,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:12:51,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105426693] [2024-11-20 00:12:51,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:51,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:12:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:12:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:12:51,414 INFO L87 Difference]: Start difference. First operand 1027 states and 1476 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:12:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:53,543 INFO L93 Difference]: Finished difference Result 3232 states and 4597 transitions. [2024-11-20 00:12:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:12:53,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-20 00:12:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:53,551 INFO L225 Difference]: With dead ends: 3232 [2024-11-20 00:12:53,551 INFO L226 Difference]: Without dead ends: 1390 [2024-11-20 00:12:53,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:12:53,557 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2975 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2994 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:53,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2994 Valid, 2540 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:12:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-20 00:12:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1235. [2024-11-20 00:12:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1018 states have (on average 1.4145383104125737) internal successors, (1440), 1035 states have internal predecessors, (1440), 130 states have call successors, (130), 71 states have call predecessors, (130), 85 states have return successors, (169), 132 states have call predecessors, (169), 126 states have call successors, (169) [2024-11-20 00:12:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1739 transitions. [2024-11-20 00:12:53,643 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1739 transitions. Word has length 66 [2024-11-20 00:12:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:53,643 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1739 transitions. [2024-11-20 00:12:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:12:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1739 transitions. [2024-11-20 00:12:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:12:53,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:53,645 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] [2024-11-20 00:12:53,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:12:53,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:53,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1833819556, now seen corresponding path program 1 times [2024-11-20 00:12:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115047564] [2024-11-20 00:12:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:12:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:12:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115047564] [2024-11-20 00:12:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115047564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:12:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082559524] [2024-11-20 00:12:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:53,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:12:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:53,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:12:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:12:53,768 INFO L87 Difference]: Start difference. First operand 1235 states and 1739 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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-11-20 00:12:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:55,106 INFO L93 Difference]: Finished difference Result 2191 states and 3045 transitions. [2024-11-20 00:12:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:12:55,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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 67 [2024-11-20 00:12:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:55,114 INFO L225 Difference]: With dead ends: 2191 [2024-11-20 00:12:55,115 INFO L226 Difference]: Without dead ends: 1372 [2024-11-20 00:12:55,117 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-11-20 00:12:55,118 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 990 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:55,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 2717 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:12:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-20 00:12:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1280. [2024-11-20 00:12:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1054 states have (on average 1.4003795066413662) internal successors, (1476), 1071 states have internal predecessors, (1476), 130 states have call successors, (130), 71 states have call predecessors, (130), 94 states have return successors, (178), 141 states have call predecessors, (178), 126 states have call successors, (178) [2024-11-20 00:12:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1784 transitions. [2024-11-20 00:12:55,205 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1784 transitions. Word has length 67 [2024-11-20 00:12:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:55,205 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1784 transitions. [2024-11-20 00:12:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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-11-20 00:12:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1784 transitions. [2024-11-20 00:12:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:12:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:55,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:12:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:12:55,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1074944346, now seen corresponding path program 1 times [2024-11-20 00:12:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909162980] [2024-11-20 00:12:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:12:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:12:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909162980] [2024-11-20 00:12:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909162980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:55,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:12:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593451903] [2024-11-20 00:12:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:55,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:12:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:12:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:12:55,362 INFO L87 Difference]: Start difference. First operand 1280 states and 1784 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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-11-20 00:12:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:56,782 INFO L93 Difference]: Finished difference Result 2260 states and 3087 transitions. [2024-11-20 00:12:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:12:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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 67 [2024-11-20 00:12:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:56,793 INFO L225 Difference]: With dead ends: 2260 [2024-11-20 00:12:56,794 INFO L226 Difference]: Without dead ends: 1483 [2024-11-20 00:12:56,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:12:56,798 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 1508 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:56,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 2239 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:12:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-20 00:12:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1289. [2024-11-20 00:12:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1063 states have (on average 1.3951081843838193) internal successors, (1483), 1078 states have internal predecessors, (1483), 131 states have call successors, (131), 72 states have call predecessors, (131), 93 states have return successors, (174), 142 states have call predecessors, (174), 127 states have call successors, (174) [2024-11-20 00:12:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1788 transitions. [2024-11-20 00:12:56,896 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1788 transitions. Word has length 67 [2024-11-20 00:12:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:56,897 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1788 transitions. [2024-11-20 00:12:56,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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-11-20 00:12:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1788 transitions. [2024-11-20 00:12:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:12:56,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:56,899 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] [2024-11-20 00:12:56,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:12:56,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:56,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1208957852, now seen corresponding path program 1 times [2024-11-20 00:12:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445563344] [2024-11-20 00:12:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:12:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:12:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445563344] [2024-11-20 00:12:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445563344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515317575] [2024-11-20 00:12:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:57,024 INFO L87 Difference]: Start difference. First operand 1289 states and 1788 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-11-20 00:12:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:58,020 INFO L93 Difference]: Finished difference Result 3174 states and 4307 transitions. [2024-11-20 00:12:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:12:58,023 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), 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 67 [2024-11-20 00:12:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:58,038 INFO L225 Difference]: With dead ends: 3174 [2024-11-20 00:12:58,038 INFO L226 Difference]: Without dead ends: 2304 [2024-11-20 00:12:58,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:12:58,044 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1832 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1513 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:12:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-11-20 00:12:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2138. [2024-11-20 00:12:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1717 states have (on average 1.3447874199184624) internal successors, (2309), 1745 states have internal predecessors, (2309), 235 states have call successors, (235), 136 states have call predecessors, (235), 184 states have return successors, (364), 263 states have call predecessors, (364), 231 states have call successors, (364) [2024-11-20 00:12:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2908 transitions. [2024-11-20 00:12:58,218 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2908 transitions. Word has length 67 [2024-11-20 00:12:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:58,219 INFO L471 AbstractCegarLoop]: Abstraction has 2138 states and 2908 transitions. [2024-11-20 00:12:58,219 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), 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-11-20 00:12:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2908 transitions. [2024-11-20 00:12:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:12:58,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:58,221 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] [2024-11-20 00:12:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:12:58,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:58,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash 755715187, now seen corresponding path program 1 times [2024-11-20 00:12:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649487900] [2024-11-20 00:12:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:12:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:12:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:12:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:12:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:12:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649487900] [2024-11-20 00:12:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649487900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:12:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376591841] [2024-11-20 00:12:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:12:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:12:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:12:58,309 INFO L87 Difference]: Start difference. First operand 2138 states and 2908 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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-11-20 00:12:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:59,099 INFO L93 Difference]: Finished difference Result 3861 states and 5264 transitions. [2024-11-20 00:12:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:12:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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 68 [2024-11-20 00:12:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:59,104 INFO L225 Difference]: With dead ends: 3861 [2024-11-20 00:12:59,104 INFO L226 Difference]: Without dead ends: 396 [2024-11-20 00:12:59,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:12:59,113 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1341 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:59,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1451 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:12:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-20 00:12:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-20 00:12:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.559556786703601) internal successors, (563), 363 states have internal predecessors, (563), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 00:12:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 617 transitions. [2024-11-20 00:12:59,128 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 617 transitions. Word has length 68 [2024-11-20 00:12:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:59,128 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 617 transitions. [2024-11-20 00:12:59,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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-11-20 00:12:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 617 transitions. [2024-11-20 00:12:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:12:59,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:59,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:12:59,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:12:59,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:59,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash 892122814, now seen corresponding path program 1 times [2024-11-20 00:12:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489873174] [2024-11-20 00:12:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:12:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:12:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:12:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:12:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:12:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489873174] [2024-11-20 00:12:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489873174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:12:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244432032] [2024-11-20 00:12:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:12:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:12:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:12:59,326 INFO L87 Difference]: Start difference. First operand 396 states and 617 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-20 00:13:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:00,693 INFO L93 Difference]: Finished difference Result 927 states and 1470 transitions. [2024-11-20 00:13:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:13:00,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:00,697 INFO L225 Difference]: With dead ends: 927 [2024-11-20 00:13:00,697 INFO L226 Difference]: Without dead ends: 538 [2024-11-20 00:13:00,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:13:00,699 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1057 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:00,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 792 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:13:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-20 00:13:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-20 00:13:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.556786703601108) internal successors, (562), 363 states have internal predecessors, (562), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 00:13:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2024-11-20 00:13:00,724 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 616 transitions. Word has length 179 [2024-11-20 00:13:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:00,725 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 616 transitions. [2024-11-20 00:13:00,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-20 00:13:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 616 transitions. [2024-11-20 00:13:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:00,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:00,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:00,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:13:00,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 243530044, now seen corresponding path program 1 times [2024-11-20 00:13:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620253049] [2024-11-20 00:13:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620253049] [2024-11-20 00:13:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620253049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:00,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:13:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563289544] [2024-11-20 00:13:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:00,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:13:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:13:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:13:00,957 INFO L87 Difference]: Start difference. First operand 396 states and 616 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-20 00:13:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:02,369 INFO L93 Difference]: Finished difference Result 919 states and 1453 transitions. [2024-11-20 00:13:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:13:02,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:02,373 INFO L225 Difference]: With dead ends: 919 [2024-11-20 00:13:02,373 INFO L226 Difference]: Without dead ends: 538 [2024-11-20 00:13:02,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:13:02,375 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1048 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:02,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 790 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:13:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-20 00:13:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-20 00:13:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.554016620498615) internal successors, (561), 363 states have internal predecessors, (561), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 00:13:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 615 transitions. [2024-11-20 00:13:02,414 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 615 transitions. Word has length 179 [2024-11-20 00:13:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 615 transitions. [2024-11-20 00:13:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-20 00:13:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2024-11-20 00:13:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:02,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:02,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:13:02,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -255026758, now seen corresponding path program 1 times [2024-11-20 00:13:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818844331] [2024-11-20 00:13:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818844331] [2024-11-20 00:13:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818844331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:02,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:02,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:13:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227244577] [2024-11-20 00:13:02,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:02,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:13:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:13:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:13:02,683 INFO L87 Difference]: Start difference. First operand 396 states and 615 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-20 00:13:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:05,154 INFO L93 Difference]: Finished difference Result 1448 states and 2304 transitions. [2024-11-20 00:13:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:13:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:05,159 INFO L225 Difference]: With dead ends: 1448 [2024-11-20 00:13:05,160 INFO L226 Difference]: Without dead ends: 1073 [2024-11-20 00:13:05,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:13:05,161 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1591 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:05,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1352 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 00:13:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-20 00:13:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 788. [2024-11-20 00:13:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 725 states have (on average 1.566896551724138) internal successors, (1136), 728 states have internal predecessors, (1136), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-20 00:13:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1235 transitions. [2024-11-20 00:13:05,211 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1235 transitions. Word has length 179 [2024-11-20 00:13:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:05,212 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1235 transitions. [2024-11-20 00:13:05,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-20 00:13:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1235 transitions. [2024-11-20 00:13:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:05,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:05,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:05,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:13:05,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1640766538, now seen corresponding path program 1 times [2024-11-20 00:13:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152323051] [2024-11-20 00:13:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152323051] [2024-11-20 00:13:05,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152323051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:05,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:05,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759419296] [2024-11-20 00:13:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:05,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:05,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:05,526 INFO L87 Difference]: Start difference. First operand 788 states and 1235 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:09,224 INFO L93 Difference]: Finished difference Result 2395 states and 3822 transitions. [2024-11-20 00:13:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:13:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:09,237 INFO L225 Difference]: With dead ends: 2395 [2024-11-20 00:13:09,238 INFO L226 Difference]: Without dead ends: 1628 [2024-11-20 00:13:09,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:13:09,244 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1737 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:09,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 1762 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 00:13:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-20 00:13:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1154. [2024-11-20 00:13:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5606773283160866) internal successors, (1659), 1067 states have internal predecessors, (1659), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-20 00:13:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1802 transitions. [2024-11-20 00:13:09,322 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1802 transitions. Word has length 179 [2024-11-20 00:13:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:09,323 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1802 transitions. [2024-11-20 00:13:09,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1802 transitions. [2024-11-20 00:13:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:09,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:09,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:13:09,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2042931700, now seen corresponding path program 1 times [2024-11-20 00:13:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490128348] [2024-11-20 00:13:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490128348] [2024-11-20 00:13:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490128348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141727164] [2024-11-20 00:13:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:09,641 INFO L87 Difference]: Start difference. First operand 1154 states and 1802 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:11,488 INFO L93 Difference]: Finished difference Result 2777 states and 4427 transitions. [2024-11-20 00:13:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:11,500 INFO L225 Difference]: With dead ends: 2777 [2024-11-20 00:13:11,501 INFO L226 Difference]: Without dead ends: 1644 [2024-11-20 00:13:11,506 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-11-20 00:13:11,506 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1157 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:11,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1322 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:13:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-20 00:13:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1154. [2024-11-20 00:13:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5578551269990593) internal successors, (1656), 1067 states have internal predecessors, (1656), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-20 00:13:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1799 transitions. [2024-11-20 00:13:11,613 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1799 transitions. Word has length 179 [2024-11-20 00:13:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:11,614 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1799 transitions. [2024-11-20 00:13:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1799 transitions. [2024-11-20 00:13:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:11,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:11,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:11,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:13:11,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:11,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash 637740022, now seen corresponding path program 1 times [2024-11-20 00:13:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459337130] [2024-11-20 00:13:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459337130] [2024-11-20 00:13:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459337130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:11,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:11,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:11,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446996741] [2024-11-20 00:13:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:11,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:11,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:11,911 INFO L87 Difference]: Start difference. First operand 1154 states and 1799 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:13,762 INFO L93 Difference]: Finished difference Result 2773 states and 4410 transitions. [2024-11-20 00:13:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:13,770 INFO L225 Difference]: With dead ends: 2773 [2024-11-20 00:13:13,771 INFO L226 Difference]: Without dead ends: 1640 [2024-11-20 00:13:13,773 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-11-20 00:13:13,774 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1155 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:13,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1322 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:13:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-20 00:13:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1154. [2024-11-20 00:13:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5550329256820319) internal successors, (1653), 1067 states have internal predecessors, (1653), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-20 00:13:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1796 transitions. [2024-11-20 00:13:13,850 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1796 transitions. Word has length 179 [2024-11-20 00:13:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1796 transitions. [2024-11-20 00:13:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1796 transitions. [2024-11-20 00:13:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:13,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:13,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:13,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:13:13,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1762893388, now seen corresponding path program 1 times [2024-11-20 00:13:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248333040] [2024-11-20 00:13:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:14,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248333040] [2024-11-20 00:13:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248333040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126449533] [2024-11-20 00:13:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:14,130 INFO L87 Difference]: Start difference. First operand 1154 states and 1796 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:17,475 INFO L93 Difference]: Finished difference Result 3782 states and 5991 transitions. [2024-11-20 00:13:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:13:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:17,488 INFO L225 Difference]: With dead ends: 3782 [2024-11-20 00:13:17,489 INFO L226 Difference]: Without dead ends: 2649 [2024-11-20 00:13:17,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:13:17,492 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1618 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:17,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 2626 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 00:13:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2024-11-20 00:13:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1895. [2024-11-20 00:13:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1748 states have (on average 1.5491990846681922) internal successors, (2708), 1754 states have internal predecessors, (2708), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-20 00:13:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2943 transitions. [2024-11-20 00:13:17,619 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2943 transitions. Word has length 179 [2024-11-20 00:13:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:17,620 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2943 transitions. [2024-11-20 00:13:17,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2943 transitions. [2024-11-20 00:13:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:17,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:17,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:17,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:13:17,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:17,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash -316312522, now seen corresponding path program 1 times [2024-11-20 00:13:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:17,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904169775] [2024-11-20 00:13:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904169775] [2024-11-20 00:13:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904169775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:17,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:17,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013838908] [2024-11-20 00:13:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:17,900 INFO L87 Difference]: Start difference. First operand 1895 states and 2943 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:19,472 INFO L93 Difference]: Finished difference Result 4509 states and 7125 transitions. [2024-11-20 00:13:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:19,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:19,485 INFO L225 Difference]: With dead ends: 4509 [2024-11-20 00:13:19,485 INFO L226 Difference]: Without dead ends: 2635 [2024-11-20 00:13:19,490 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-11-20 00:13:19,491 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1321 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:19,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1110 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:13:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-11-20 00:13:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 1895. [2024-11-20 00:13:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1748 states have (on average 1.5463386727688788) internal successors, (2703), 1754 states have internal predecessors, (2703), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-20 00:13:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2938 transitions. [2024-11-20 00:13:19,634 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2938 transitions. Word has length 179 [2024-11-20 00:13:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2938 transitions. [2024-11-20 00:13:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2938 transitions. [2024-11-20 00:13:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:19,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:19,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:19,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:13:19,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1239479948, now seen corresponding path program 1 times [2024-11-20 00:13:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181731516] [2024-11-20 00:13:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181731516] [2024-11-20 00:13:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181731516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543487338] [2024-11-20 00:13:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:19,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:19,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:19,907 INFO L87 Difference]: Start difference. First operand 1895 states and 2938 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:23,464 INFO L93 Difference]: Finished difference Result 6471 states and 10182 transitions. [2024-11-20 00:13:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:13:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:23,487 INFO L225 Difference]: With dead ends: 6471 [2024-11-20 00:13:23,488 INFO L226 Difference]: Without dead ends: 4597 [2024-11-20 00:13:23,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:13:23,496 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1606 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:23,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2626 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3480 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 00:13:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2024-11-20 00:13:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3381. [2024-11-20 00:13:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5409993593850095) internal successors, (4811), 3132 states have internal predecessors, (4811), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-20 00:13:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5236 transitions. [2024-11-20 00:13:23,781 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5236 transitions. Word has length 179 [2024-11-20 00:13:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5236 transitions. [2024-11-20 00:13:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5236 transitions. [2024-11-20 00:13:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:23,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:23,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:13:23,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -853617546, now seen corresponding path program 1 times [2024-11-20 00:13:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847418648] [2024-11-20 00:13:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:24,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847418648] [2024-11-20 00:13:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847418648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684136653] [2024-11-20 00:13:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:24,030 INFO L87 Difference]: Start difference. First operand 3381 states and 5236 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:25,790 INFO L93 Difference]: Finished difference Result 7977 states and 12548 transitions. [2024-11-20 00:13:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:25,823 INFO L225 Difference]: With dead ends: 7977 [2024-11-20 00:13:25,823 INFO L226 Difference]: Without dead ends: 4617 [2024-11-20 00:13:25,834 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-11-20 00:13:25,836 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1158 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:25,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1322 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:13:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-11-20 00:13:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3381. [2024-11-20 00:13:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5381165919282511) internal successors, (4802), 3132 states have internal predecessors, (4802), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-20 00:13:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5227 transitions. [2024-11-20 00:13:26,107 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5227 transitions. Word has length 179 [2024-11-20 00:13:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5227 transitions. [2024-11-20 00:13:26,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5227 transitions. [2024-11-20 00:13:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:26,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:26,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:13:26,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1118265036, now seen corresponding path program 1 times [2024-11-20 00:13:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66319599] [2024-11-20 00:13:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66319599] [2024-11-20 00:13:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66319599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:26,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:26,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784397237] [2024-11-20 00:13:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:26,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:26,366 INFO L87 Difference]: Start difference. First operand 3381 states and 5227 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:28,011 INFO L93 Difference]: Finished difference Result 7957 states and 12481 transitions. [2024-11-20 00:13:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:28,027 INFO L225 Difference]: With dead ends: 7957 [2024-11-20 00:13:28,027 INFO L226 Difference]: Without dead ends: 4597 [2024-11-20 00:13:28,037 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-11-20 00:13:28,038 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1384 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:28,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1109 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:13:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2024-11-20 00:13:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3381. [2024-11-20 00:13:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5352338244714927) internal successors, (4793), 3132 states have internal predecessors, (4793), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-20 00:13:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5218 transitions. [2024-11-20 00:13:28,373 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5218 transitions. Word has length 179 [2024-11-20 00:13:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:28,374 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5218 transitions. [2024-11-20 00:13:28,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5218 transitions. [2024-11-20 00:13:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:28,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:28,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:13:28,377 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1853523314, now seen corresponding path program 1 times [2024-11-20 00:13:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:28,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914389757] [2024-11-20 00:13:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914389757] [2024-11-20 00:13:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914389757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113332891] [2024-11-20 00:13:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:28,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:28,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:28,662 INFO L87 Difference]: Start difference. First operand 3381 states and 5218 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:32,172 INFO L93 Difference]: Finished difference Result 11829 states and 18478 transitions. [2024-11-20 00:13:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:13:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:32,196 INFO L225 Difference]: With dead ends: 11829 [2024-11-20 00:13:32,196 INFO L226 Difference]: Without dead ends: 8469 [2024-11-20 00:13:32,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:13:32,207 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1593 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3398 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:32,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2626 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3398 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 00:13:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2024-11-20 00:13:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 6385. [2024-11-20 00:13:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 5902 states have (on average 1.5311758725855642) internal successors, (9037), 5920 states have internal predecessors, (9037), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-20 00:13:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 9860 transitions. [2024-11-20 00:13:32,647 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 9860 transitions. Word has length 179 [2024-11-20 00:13:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 6385 states and 9860 transitions. [2024-11-20 00:13:32,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 9860 transitions. [2024-11-20 00:13:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:32,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:32,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:32,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:13:32,653 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash -544464524, now seen corresponding path program 1 times [2024-11-20 00:13:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387557014] [2024-11-20 00:13:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387557014] [2024-11-20 00:13:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387557014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167804146] [2024-11-20 00:13:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:32,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:32,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:32,902 INFO L87 Difference]: Start difference. First operand 6385 states and 9860 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:37,105 INFO L93 Difference]: Finished difference Result 22607 states and 35334 transitions. [2024-11-20 00:13:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:13:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:37,153 INFO L225 Difference]: With dead ends: 22607 [2024-11-20 00:13:37,154 INFO L226 Difference]: Without dead ends: 16243 [2024-11-20 00:13:37,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:13:37,174 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1592 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:37,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 2626 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 00:13:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16243 states. [2024-11-20 00:13:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16243 to 12402. [2024-11-20 00:13:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12402 states, 11471 states have (on average 1.5286374335280273) internal successors, (17535), 11505 states have internal predecessors, (17535), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-20 00:13:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12402 states to 12402 states and 19208 transitions. [2024-11-20 00:13:38,143 INFO L78 Accepts]: Start accepts. Automaton has 12402 states and 19208 transitions. Word has length 179 [2024-11-20 00:13:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 12402 states and 19208 transitions. [2024-11-20 00:13:38,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12402 states and 19208 transitions. [2024-11-20 00:13:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:38,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:38,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:38,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:13:38,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -206176974, now seen corresponding path program 1 times [2024-11-20 00:13:38,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:38,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789644708] [2024-11-20 00:13:38,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789644708] [2024-11-20 00:13:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789644708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012915014] [2024-11-20 00:13:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:38,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:38,390 INFO L87 Difference]: Start difference. First operand 12402 states and 19208 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:41,125 INFO L93 Difference]: Finished difference Result 28785 states and 45214 transitions. [2024-11-20 00:13:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:13:41,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:41,184 INFO L225 Difference]: With dead ends: 28785 [2024-11-20 00:13:41,184 INFO L226 Difference]: Without dead ends: 16404 [2024-11-20 00:13:41,215 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-11-20 00:13:41,216 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1153 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:41,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1320 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:13:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16404 states. [2024-11-20 00:13:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16404 to 12402. [2024-11-20 00:13:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12402 states, 11471 states have (on average 1.5257606137215587) internal successors, (17502), 11505 states have internal predecessors, (17502), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-20 00:13:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12402 states to 12402 states and 19175 transitions. [2024-11-20 00:13:42,086 INFO L78 Accepts]: Start accepts. Automaton has 12402 states and 19175 transitions. Word has length 179 [2024-11-20 00:13:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 12402 states and 19175 transitions. [2024-11-20 00:13:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12402 states and 19175 transitions. [2024-11-20 00:13:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:42,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:42,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:13:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:13:42,095 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 220377524, now seen corresponding path program 1 times [2024-11-20 00:13:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795601553] [2024-11-20 00:13:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795601553] [2024-11-20 00:13:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795601553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103175048] [2024-11-20 00:13:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:42,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:42,321 INFO L87 Difference]: Start difference. First operand 12402 states and 19175 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:13:47,738 INFO L93 Difference]: Finished difference Result 49404 states and 77158 transitions. [2024-11-20 00:13:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:13:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-20 00:13:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:13:47,869 INFO L225 Difference]: With dead ends: 49404 [2024-11-20 00:13:47,869 INFO L226 Difference]: Without dead ends: 37023 [2024-11-20 00:13:47,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:13:47,907 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 2030 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:13:47,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 2612 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 00:13:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37023 states. [2024-11-20 00:13:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37023 to 24148. [2024-11-20 00:13:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24148 states, 22353 states have (on average 1.5225696774482171) internal successors, (34034), 22419 states have internal predecessors, (34034), 1340 states have call successors, (1340), 391 states have call predecessors, (1340), 454 states have return successors, (2131), 1401 states have call predecessors, (2131), 1338 states have call successors, (2131) [2024-11-20 00:13:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24148 states to 24148 states and 37505 transitions. [2024-11-20 00:13:49,631 INFO L78 Accepts]: Start accepts. Automaton has 24148 states and 37505 transitions. Word has length 179 [2024-11-20 00:13:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:13:49,631 INFO L471 AbstractCegarLoop]: Abstraction has 24148 states and 37505 transitions. [2024-11-20 00:13:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-20 00:13:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24148 states and 37505 transitions. [2024-11-20 00:13:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:13:49,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:13:49,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:13:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:13:49,645 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:13:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:13:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -320051982, now seen corresponding path program 1 times [2024-11-20 00:13:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:13:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178298898] [2024-11-20 00:13:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:13:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:13:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:13:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 00:13:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:13:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:13:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 00:13:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:13:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:13:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:13:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178298898] [2024-11-20 00:13:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178298898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:13:49,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:13:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:13:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129494742] [2024-11-20 00:13:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:13:49,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:13:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:13:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:13:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:13:49,879 INFO L87 Difference]: Start difference. First operand 24148 states and 37505 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)