./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.02.cil-2.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.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:10:47,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:10:47,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:10:47,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:10:47,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:10:47,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:10:47,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:10:47,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:10:47,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:10:47,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:10:47,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:10:47,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:10:47,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:10:47,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:10:47,232 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:10:47,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:10:47,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:10:47,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:10:47,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:10:47,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:10:47,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:10:47,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:10:47,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:10:47,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:10:47,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:10:47,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:10:47,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:10:47,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:10:47,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:10:47,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:10:47,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:10:47,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:10:47,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:10:47,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:10:47,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:10:47,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:10:47,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:10:47,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:10:47,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:10:47,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:10:47,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:10:47,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:10:47,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2024-11-20 00:10:47,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:10:47,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:10:47,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:10:47,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:10:47,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:10:47,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-20 00:10:48,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:10:49,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:10:49,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-20 00:10:49,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4746155/e80102733e104e6b8bbf5ddacf780b7e/FLAGca9045f38 [2024-11-20 00:10:49,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4746155/e80102733e104e6b8bbf5ddacf780b7e [2024-11-20 00:10:49,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:10:49,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:10:49,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:49,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:10:49,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:10:49,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49, skipping insertion in model container [2024-11-20 00:10:49,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:10:49,403 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.02.cil-2.c[911,924] [2024-11-20 00:10:49,477 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.02.cil-2.c[8416,8429] [2024-11-20 00:10:49,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:49,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:10:49,557 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.02.cil-2.c[911,924] [2024-11-20 00:10:49,609 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.02.cil-2.c[8416,8429] [2024-11-20 00:10:49,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:49,676 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:10:49,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49 WrapperNode [2024-11-20 00:10:49,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:49,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:49,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:10:49,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:10:49,686 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:10:49" (1/1) ... [2024-11-20 00:10:49,699 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:10:49" (1/1) ... [2024-11-20 00:10:49,732 INFO L138 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 512 [2024-11-20 00:10:49,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:49,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:10:49,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:10:49,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:10:49,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,767 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:10:49,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:10:49,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:10:49,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:10:49,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:10:49,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (1/1) ... [2024-11-20 00:10:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:10:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:49,827 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:10:49,831 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:10:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:10:49,881 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:10:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:10:49,881 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:10:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:10:49,881 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:10:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:10:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:10:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:10:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:10:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:10:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:10:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:10:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:10:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:10:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:10:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:10:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:10:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:10:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:10:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:10:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:10:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:10:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:10:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:10:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:10:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:10:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:10:50,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:10:50,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:10:50,523 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-20 00:10:50,524 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:10:50,619 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-20 00:10:50,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:10:50,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:10:50,648 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-20 00:10:50,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:50 BoogieIcfgContainer [2024-11-20 00:10:50,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:10:50,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:10:50,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:10:50,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:10:50,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:10:49" (1/3) ... [2024-11-20 00:10:50,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58890bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:50, skipping insertion in model container [2024-11-20 00:10:50,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:49" (2/3) ... [2024-11-20 00:10:50,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58890bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:50, skipping insertion in model container [2024-11-20 00:10:50,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:50" (3/3) ... [2024-11-20 00:10:50,658 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-20 00:10:50,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:10:50,675 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:10:50,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:10:50,747 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;@cf2b185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:10:50,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:10:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 208 states have (on average 1.5576923076923077) internal successors, (324), 216 states have internal predecessors, (324), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 00:10:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:50,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:50,766 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:10:50,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:50,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1504426887, now seen corresponding path program 1 times [2024-11-20 00:10:50,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146353387] [2024-11-20 00:10:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:50,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,434 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:10:51,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146353387] [2024-11-20 00:10:51,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146353387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869671109] [2024-11-20 00:10:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:51,470 INFO L87 Difference]: Start difference. First operand has 260 states, 208 states have (on average 1.5576923076923077) internal successors, (324), 216 states have internal predecessors, (324), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 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:10:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:52,627 INFO L93 Difference]: Finished difference Result 652 states and 991 transitions. [2024-11-20 00:10:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:52,631 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:10:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:52,651 INFO L225 Difference]: With dead ends: 652 [2024-11-20 00:10:52,652 INFO L226 Difference]: Without dead ends: 400 [2024-11-20 00:10:52,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:10:52,665 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 527 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:52,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1241 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:10:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-20 00:10:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 361. [2024-11-20 00:10:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 290 states have (on average 1.4517241379310344) internal successors, (421), 297 states have internal predecessors, (421), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-20 00:10:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 516 transitions. [2024-11-20 00:10:52,757 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 516 transitions. Word has length 65 [2024-11-20 00:10:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:52,758 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 516 transitions. [2024-11-20 00:10:52,758 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:10:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 516 transitions. [2024-11-20 00:10:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:52,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:52,763 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:10:52,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:10:52,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:52,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash 33913143, now seen corresponding path program 1 times [2024-11-20 00:10:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731590657] [2024-11-20 00:10:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,938 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:10:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731590657] [2024-11-20 00:10:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731590657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:52,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962231702] [2024-11-20 00:10:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:52,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:52,942 INFO L87 Difference]: Start difference. First operand 361 states and 516 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:10:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:53,755 INFO L93 Difference]: Finished difference Result 829 states and 1168 transitions. [2024-11-20 00:10:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:53,756 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:10:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:53,761 INFO L225 Difference]: With dead ends: 829 [2024-11-20 00:10:53,764 INFO L226 Difference]: Without dead ends: 620 [2024-11-20 00:10:53,766 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:10:53,768 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 956 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:53,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 896 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-20 00:10:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 546. [2024-11-20 00:10:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 439 states have (on average 1.4236902050113895) internal successors, (625), 448 states have internal predecessors, (625), 67 states have call successors, (67), 36 states have call predecessors, (67), 38 states have return successors, (71), 64 states have call predecessors, (71), 63 states have call successors, (71) [2024-11-20 00:10:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 763 transitions. [2024-11-20 00:10:53,840 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 763 transitions. Word has length 65 [2024-11-20 00:10:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 763 transitions. [2024-11-20 00:10:53,841 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:10:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 763 transitions. [2024-11-20 00:10:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:53,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:53,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:53,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:10:53,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:53,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1774921652, now seen corresponding path program 1 times [2024-11-20 00:10:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:53,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797164450] [2024-11-20 00:10:53,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:10:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,028 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:10:54,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797164450] [2024-11-20 00:10:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797164450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:54,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497063996] [2024-11-20 00:10:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:54,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:54,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:54,033 INFO L87 Difference]: Start difference. First operand 546 states and 763 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:10:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:54,814 INFO L93 Difference]: Finished difference Result 1010 states and 1404 transitions. [2024-11-20 00:10:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:54,815 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:10:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:54,821 INFO L225 Difference]: With dead ends: 1010 [2024-11-20 00:10:54,821 INFO L226 Difference]: Without dead ends: 616 [2024-11-20 00:10:54,822 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:10:54,823 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 394 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:54,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1333 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-20 00:10:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 556. [2024-11-20 00:10:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.4116331096196868) internal successors, (631), 456 states have internal predecessors, (631), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (73), 66 states have call predecessors, (73), 63 states have call successors, (73) [2024-11-20 00:10:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 771 transitions. [2024-11-20 00:10:54,869 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 771 transitions. Word has length 66 [2024-11-20 00:10:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:54,871 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 771 transitions. [2024-11-20 00:10:54,871 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:10:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 771 transitions. [2024-11-20 00:10:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:54,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:54,873 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:10:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:10:54,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1490686346, now seen corresponding path program 1 times [2024-11-20 00:10:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612228485] [2024-11-20 00:10:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:10:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:55,079 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:10:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612228485] [2024-11-20 00:10:55,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612228485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:55,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:55,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431184584] [2024-11-20 00:10:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:55,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:55,082 INFO L87 Difference]: Start difference. First operand 556 states and 771 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:10:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:56,857 INFO L93 Difference]: Finished difference Result 2096 states and 2935 transitions. [2024-11-20 00:10:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:10:56,858 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:10:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:56,866 INFO L225 Difference]: With dead ends: 2096 [2024-11-20 00:10:56,866 INFO L226 Difference]: Without dead ends: 834 [2024-11-20 00:10:56,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:10:56,873 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1661 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:56,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 1465 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-20 00:10:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 696. [2024-11-20 00:10:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 550 states have (on average 1.3763636363636365) internal successors, (757), 561 states have internal predecessors, (757), 87 states have call successors, (87), 50 states have call predecessors, (87), 57 states have return successors, (104), 87 states have call predecessors, (104), 83 states have call successors, (104) [2024-11-20 00:10:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 948 transitions. [2024-11-20 00:10:56,943 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 948 transitions. Word has length 66 [2024-11-20 00:10:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:56,944 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 948 transitions. [2024-11-20 00:10:56,944 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:10:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 948 transitions. [2024-11-20 00:10:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:10:56,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:56,945 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:10:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:10:56,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:56,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1441856857, now seen corresponding path program 1 times [2024-11-20 00:10:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828139809] [2024-11-20 00:10:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:10:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:10:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,103 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:10:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828139809] [2024-11-20 00:10:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828139809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027616167] [2024-11-20 00:10:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:57,106 INFO L87 Difference]: Start difference. First operand 696 states and 948 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:57,921 INFO L93 Difference]: Finished difference Result 1615 states and 2202 transitions. [2024-11-20 00:10:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 00:10:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-20 00:10:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:57,923 INFO L225 Difference]: With dead ends: 1615 [2024-11-20 00:10:57,924 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 00:10:57,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-20 00:10:57,928 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 773 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:57,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1055 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 00:10:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-20 00:10:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 115 states have internal predecessors, (167), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 00:10:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-11-20 00:10:57,936 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 67 [2024-11-20 00:10:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:57,936 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-11-20 00:10:57,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-11-20 00:10:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:10:57,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:57,937 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] [2024-11-20 00:10:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:10:57,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -166345420, now seen corresponding path program 1 times [2024-11-20 00:10:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:57,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075070791] [2024-11-20 00:10:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,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:10:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075070791] [2024-11-20 00:10:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075070791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:58,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:58,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625807072] [2024-11-20 00:10:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:58,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:58,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:58,024 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:10:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:58,641 INFO L93 Difference]: Finished difference Result 454 states and 678 transitions. [2024-11-20 00:10:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2024-11-20 00:10:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:58,644 INFO L225 Difference]: With dead ends: 454 [2024-11-20 00:10:58,645 INFO L226 Difference]: Without dead ends: 327 [2024-11-20 00:10:58,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:58,648 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 431 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:58,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 498 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:10:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-20 00:10:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 262. [2024-11-20 00:10:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 222 states have internal predecessors, (326), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-11-20 00:10:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 385 transitions. [2024-11-20 00:10:58,669 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 385 transitions. Word has length 69 [2024-11-20 00:10:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:58,669 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 385 transitions. [2024-11-20 00:10:58,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:10:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 385 transitions. [2024-11-20 00:10:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:10:58,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:58,670 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] [2024-11-20 00:10:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:10:58,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:58,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash -63631056, now seen corresponding path program 1 times [2024-11-20 00:10:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403254727] [2024-11-20 00:10:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,805 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:10:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403254727] [2024-11-20 00:10:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403254727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272201590] [2024-11-20 00:10:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:58,808 INFO L87 Difference]: Start difference. First operand 262 states and 385 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:10:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:59,672 INFO L93 Difference]: Finished difference Result 733 states and 1088 transitions. [2024-11-20 00:10:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:10:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:59,676 INFO L225 Difference]: With dead ends: 733 [2024-11-20 00:10:59,676 INFO L226 Difference]: Without dead ends: 482 [2024-11-20 00:10:59,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:59,678 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 432 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:59,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 930 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-20 00:10:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 379. [2024-11-20 00:10:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.4811320754716981) internal successors, (471), 322 states have internal predecessors, (471), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-20 00:10:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 554 transitions. [2024-11-20 00:10:59,706 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 554 transitions. Word has length 69 [2024-11-20 00:10:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:59,706 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 554 transitions. [2024-11-20 00:10:59,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:10:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 554 transitions. [2024-11-20 00:10:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:10:59,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:59,707 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] [2024-11-20 00:10:59,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:10:59,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:59,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1323154354, now seen corresponding path program 1 times [2024-11-20 00:10:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:59,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728340779] [2024-11-20 00:10:59,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:59,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,811 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:10:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728340779] [2024-11-20 00:10:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728340779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575847882] [2024-11-20 00:10:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:59,813 INFO L87 Difference]: Start difference. First operand 379 states and 554 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:00,268 INFO L93 Difference]: Finished difference Result 846 states and 1257 transitions. [2024-11-20 00:11:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:00,273 INFO L225 Difference]: With dead ends: 846 [2024-11-20 00:11:00,273 INFO L226 Difference]: Without dead ends: 478 [2024-11-20 00:11:00,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:00,275 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 344 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:00,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 457 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-20 00:11:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 379. [2024-11-20 00:11:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.471698113207547) internal successors, (468), 322 states have internal predecessors, (468), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-20 00:11:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-20 00:11:00,310 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 69 [2024-11-20 00:11:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:00,310 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-20 00:11:00,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-20 00:11:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:00,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:00,311 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] [2024-11-20 00:11:00,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:11:00,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:00,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1767055028, now seen corresponding path program 1 times [2024-11-20 00:11:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:00,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568451655] [2024-11-20 00:11:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568451655] [2024-11-20 00:11:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568451655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:00,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875323609] [2024-11-20 00:11:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:00,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:00,437 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:01,287 INFO L93 Difference]: Finished difference Result 1188 states and 1741 transitions. [2024-11-20 00:11:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:11:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:01,293 INFO L225 Difference]: With dead ends: 1188 [2024-11-20 00:11:01,293 INFO L226 Difference]: Without dead ends: 820 [2024-11-20 00:11:01,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:01,295 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 475 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:01,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 914 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-20 00:11:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 594. [2024-11-20 00:11:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 499 states have (on average 1.4569138276553106) internal successors, (727), 505 states have internal predecessors, (727), 60 states have call successors, (60), 31 states have call predecessors, (60), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-20 00:11:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 858 transitions. [2024-11-20 00:11:01,341 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 858 transitions. Word has length 69 [2024-11-20 00:11:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:01,341 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 858 transitions. [2024-11-20 00:11:01,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 858 transitions. [2024-11-20 00:11:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:01,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:01,343 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] [2024-11-20 00:11:01,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:11:01,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -989572238, now seen corresponding path program 1 times [2024-11-20 00:11:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403202981] [2024-11-20 00:11:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,455 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:11:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403202981] [2024-11-20 00:11:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403202981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166860341] [2024-11-20 00:11:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:01,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:01,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:01,457 INFO L87 Difference]: Start difference. First operand 594 states and 858 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:02,412 INFO L93 Difference]: Finished difference Result 1909 states and 2766 transitions. [2024-11-20 00:11:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:11:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:02,420 INFO L225 Difference]: With dead ends: 1909 [2024-11-20 00:11:02,420 INFO L226 Difference]: Without dead ends: 1326 [2024-11-20 00:11:02,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:02,423 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 418 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:02,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 918 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-20 00:11:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1037. [2024-11-20 00:11:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 876 states have (on average 1.4531963470319635) internal successors, (1273), 886 states have internal predecessors, (1273), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-20 00:11:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1502 transitions. [2024-11-20 00:11:02,512 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1502 transitions. Word has length 69 [2024-11-20 00:11:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:02,512 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1502 transitions. [2024-11-20 00:11:02,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1502 transitions. [2024-11-20 00:11:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:02,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:02,514 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] [2024-11-20 00:11:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:11:02,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1276808948, now seen corresponding path program 1 times [2024-11-20 00:11:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174753598] [2024-11-20 00:11:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,628 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:11:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174753598] [2024-11-20 00:11:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174753598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667136510] [2024-11-20 00:11:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:02,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:02,630 INFO L87 Difference]: Start difference. First operand 1037 states and 1502 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:03,158 INFO L93 Difference]: Finished difference Result 2294 states and 3361 transitions. [2024-11-20 00:11:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 00:11:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:03,165 INFO L225 Difference]: With dead ends: 2294 [2024-11-20 00:11:03,165 INFO L226 Difference]: Without dead ends: 1269 [2024-11-20 00:11:03,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:03,169 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 148 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:03,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 640 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-20 00:11:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1064. [2024-11-20 00:11:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 903 states have (on average 1.4396456256921373) internal successors, (1300), 913 states have internal predecessors, (1300), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-20 00:11:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1529 transitions. [2024-11-20 00:11:03,280 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1529 transitions. Word has length 69 [2024-11-20 00:11:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:03,280 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1529 transitions. [2024-11-20 00:11:03,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1529 transitions. [2024-11-20 00:11:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:03,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:03,282 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] [2024-11-20 00:11:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:11:03,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1524955442, now seen corresponding path program 1 times [2024-11-20 00:11:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909342255] [2024-11-20 00:11:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,385 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:11:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909342255] [2024-11-20 00:11:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909342255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:03,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718598881] [2024-11-20 00:11:03,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:03,388 INFO L87 Difference]: Start difference. First operand 1064 states and 1529 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:11:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:04,089 INFO L93 Difference]: Finished difference Result 3535 states and 5103 transitions. [2024-11-20 00:11:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:04,103 INFO L225 Difference]: With dead ends: 3535 [2024-11-20 00:11:04,103 INFO L226 Difference]: Without dead ends: 2483 [2024-11-20 00:11:04,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:11:04,108 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 613 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:04,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 689 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-11-20 00:11:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2060. [2024-11-20 00:11:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1750 states have (on average 1.4314285714285715) internal successors, (2505), 1768 states have internal predecessors, (2505), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2936 transitions. [2024-11-20 00:11:04,299 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2936 transitions. Word has length 69 [2024-11-20 00:11:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:04,303 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 2936 transitions. [2024-11-20 00:11:04,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:11:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2936 transitions. [2024-11-20 00:11:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:04,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:04,305 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] [2024-11-20 00:11:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:11:04,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:04,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1924946641, now seen corresponding path program 1 times [2024-11-20 00:11:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513441965] [2024-11-20 00:11:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,406 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:11:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513441965] [2024-11-20 00:11:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513441965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:04,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385542794] [2024-11-20 00:11:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:04,409 INFO L87 Difference]: Start difference. First operand 2060 states and 2936 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:04,993 INFO L93 Difference]: Finished difference Result 4563 states and 6563 transitions. [2024-11-20 00:11:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:11:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:05,009 INFO L225 Difference]: With dead ends: 4563 [2024-11-20 00:11:05,009 INFO L226 Difference]: Without dead ends: 2515 [2024-11-20 00:11:05,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:11:05,017 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:05,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 640 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2024-11-20 00:11:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2087. [2024-11-20 00:11:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1777 states have (on average 1.4198086662915026) internal successors, (2523), 1795 states have internal predecessors, (2523), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2954 transitions. [2024-11-20 00:11:05,242 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2954 transitions. Word has length 69 [2024-11-20 00:11:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:05,242 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 2954 transitions. [2024-11-20 00:11:05,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2954 transitions. [2024-11-20 00:11:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:05,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:05,246 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] [2024-11-20 00:11:05,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:11:05,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1530579855, now seen corresponding path program 1 times [2024-11-20 00:11:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:05,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194039944] [2024-11-20 00:11:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,349 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:11:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194039944] [2024-11-20 00:11:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194039944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974811383] [2024-11-20 00:11:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:05,351 INFO L87 Difference]: Start difference. First operand 2087 states and 2954 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:05,844 INFO L93 Difference]: Finished difference Result 4698 states and 6689 transitions. [2024-11-20 00:11:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:11:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2024-11-20 00:11:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:05,859 INFO L225 Difference]: With dead ends: 4698 [2024-11-20 00:11:05,860 INFO L226 Difference]: Without dead ends: 2623 [2024-11-20 00:11:05,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:11:05,866 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 163 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:05,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 635 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-20 00:11:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2141. [2024-11-20 00:11:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 1831 states have (on average 1.4074276351720372) internal successors, (2577), 1849 states have internal predecessors, (2577), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3008 transitions. [2024-11-20 00:11:06,036 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3008 transitions. Word has length 69 [2024-11-20 00:11:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:06,037 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 3008 transitions. [2024-11-20 00:11:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:11:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3008 transitions. [2024-11-20 00:11:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:06,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:06,040 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] [2024-11-20 00:11:06,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:11:06,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1553212109, now seen corresponding path program 1 times [2024-11-20 00:11:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624682151] [2024-11-20 00:11:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,190 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:11:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624682151] [2024-11-20 00:11:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624682151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603700275] [2024-11-20 00:11:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:06,192 INFO L87 Difference]: Start difference. First operand 2141 states and 3008 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:06,898 INFO L93 Difference]: Finished difference Result 3067 states and 4305 transitions. [2024-11-20 00:11:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:11:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-20 00:11:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:06,908 INFO L225 Difference]: With dead ends: 3067 [2024-11-20 00:11:06,908 INFO L226 Difference]: Without dead ends: 1847 [2024-11-20 00:11:06,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:11:06,926 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 545 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:06,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 691 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-20 00:11:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1431. [2024-11-20 00:11:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1222 states have (on average 1.3968903436988542) internal successors, (1707), 1232 states have internal predecessors, (1707), 128 states have call successors, (128), 73 states have call predecessors, (128), 80 states have return successors, (147), 129 states have call predecessors, (147), 126 states have call successors, (147) [2024-11-20 00:11:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1982 transitions. [2024-11-20 00:11:07,040 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1982 transitions. Word has length 69 [2024-11-20 00:11:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:07,041 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1982 transitions. [2024-11-20 00:11:07,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1982 transitions. [2024-11-20 00:11:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:07,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:07,042 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] [2024-11-20 00:11:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:11:07,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1693760719, now seen corresponding path program 1 times [2024-11-20 00:11:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465408688] [2024-11-20 00:11:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,181 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:11:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465408688] [2024-11-20 00:11:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465408688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:07,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:07,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:07,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48755456] [2024-11-20 00:11:07,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:07,185 INFO L87 Difference]: Start difference. First operand 1431 states and 1982 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:08,119 INFO L93 Difference]: Finished difference Result 4389 states and 6072 transitions. [2024-11-20 00:11:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:11:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-20 00:11:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:08,133 INFO L225 Difference]: With dead ends: 4389 [2024-11-20 00:11:08,134 INFO L226 Difference]: Without dead ends: 2971 [2024-11-20 00:11:08,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:11:08,138 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 550 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:08,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 696 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-11-20 00:11:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2347. [2024-11-20 00:11:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1996 states have (on average 1.3802605210420842) internal successors, (2755), 2020 states have internal predecessors, (2755), 208 states have call successors, (208), 121 states have call predecessors, (208), 142 states have return successors, (263), 213 states have call predecessors, (263), 206 states have call successors, (263) [2024-11-20 00:11:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3226 transitions. [2024-11-20 00:11:08,369 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3226 transitions. Word has length 69 [2024-11-20 00:11:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3226 transitions. [2024-11-20 00:11:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3226 transitions. [2024-11-20 00:11:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:08,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:08,372 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] [2024-11-20 00:11:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:11:08,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1559747213, now seen corresponding path program 1 times [2024-11-20 00:11:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951660472] [2024-11-20 00:11:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,512 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:11:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951660472] [2024-11-20 00:11:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951660472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:08,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426439233] [2024-11-20 00:11:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:08,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:08,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:08,515 INFO L87 Difference]: Start difference. First operand 2347 states and 3226 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:09,381 INFO L93 Difference]: Finished difference Result 4675 states and 6444 transitions. [2024-11-20 00:11:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:09,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-20 00:11:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:09,395 INFO L225 Difference]: With dead ends: 4675 [2024-11-20 00:11:09,395 INFO L226 Difference]: Without dead ends: 3191 [2024-11-20 00:11:09,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:11:09,400 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 730 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:09,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 602 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2024-11-20 00:11:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2329. [2024-11-20 00:11:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1982 states have (on average 1.3718466195761856) internal successors, (2719), 2002 states have internal predecessors, (2719), 208 states have call successors, (208), 121 states have call predecessors, (208), 138 states have return successors, (243), 209 states have call predecessors, (243), 206 states have call successors, (243) [2024-11-20 00:11:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3170 transitions. [2024-11-20 00:11:09,629 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3170 transitions. Word has length 69 [2024-11-20 00:11:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:09,629 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3170 transitions. [2024-11-20 00:11:09,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3170 transitions. [2024-11-20 00:11:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:09,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:09,631 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] [2024-11-20 00:11:09,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:11:09,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1778601931, now seen corresponding path program 1 times [2024-11-20 00:11:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712790635] [2024-11-20 00:11:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,787 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:11:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712790635] [2024-11-20 00:11:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712790635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134047917] [2024-11-20 00:11:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:09,789 INFO L87 Difference]: Start difference. First operand 2329 states and 3170 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:10,616 INFO L93 Difference]: Finished difference Result 3973 states and 5388 transitions. [2024-11-20 00:11:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:10,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-20 00:11:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:10,628 INFO L225 Difference]: With dead ends: 3973 [2024-11-20 00:11:10,628 INFO L226 Difference]: Without dead ends: 2531 [2024-11-20 00:11:10,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:11:10,633 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 696 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:10,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 604 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-11-20 00:11:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 1867. [2024-11-20 00:11:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1592 states have (on average 1.3662060301507537) internal successors, (2175), 1602 states have internal predecessors, (2175), 170 states have call successors, (170), 97 states have call predecessors, (170), 104 states have return successors, (183), 169 states have call predecessors, (183), 168 states have call successors, (183) [2024-11-20 00:11:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2528 transitions. [2024-11-20 00:11:10,822 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2528 transitions. Word has length 69 [2024-11-20 00:11:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:10,822 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2528 transitions. [2024-11-20 00:11:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2528 transitions. [2024-11-20 00:11:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:11:10,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:10,824 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] [2024-11-20 00:11:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:11:10,824 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2093663539, now seen corresponding path program 1 times [2024-11-20 00:11:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835374764] [2024-11-20 00:11:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835374764] [2024-11-20 00:11:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835374764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181293212] [2024-11-20 00:11:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:10,886 INFO L87 Difference]: Start difference. First operand 1867 states and 2528 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:11:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:11,493 INFO L93 Difference]: Finished difference Result 4934 states and 6715 transitions. [2024-11-20 00:11:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:11:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-11-20 00:11:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:11,504 INFO L225 Difference]: With dead ends: 4934 [2024-11-20 00:11:11,504 INFO L226 Difference]: Without dead ends: 3071 [2024-11-20 00:11:11,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:11,509 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 474 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:11,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 381 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2024-11-20 00:11:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2499. [2024-11-20 00:11:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2130 states have (on average 1.3483568075117371) internal successors, (2872), 2152 states have internal predecessors, (2872), 226 states have call successors, (226), 133 states have call predecessors, (226), 142 states have return successors, (241), 215 states have call predecessors, (241), 224 states have call successors, (241) [2024-11-20 00:11:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3339 transitions. [2024-11-20 00:11:11,717 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3339 transitions. Word has length 69 [2024-11-20 00:11:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:11,717 INFO L471 AbstractCegarLoop]: Abstraction has 2499 states and 3339 transitions. [2024-11-20 00:11:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:11:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3339 transitions. [2024-11-20 00:11:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 00:11:11,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:11,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:11:11,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:11,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1517981594, now seen corresponding path program 1 times [2024-11-20 00:11:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744852255] [2024-11-20 00:11:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:11:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 00:11:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744852255] [2024-11-20 00:11:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744852255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:11,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702111897] [2024-11-20 00:11:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:11,945 INFO L87 Difference]: Start difference. First operand 2499 states and 3339 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:12,870 INFO L93 Difference]: Finished difference Result 8498 states and 11479 transitions. [2024-11-20 00:11:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:12,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2024-11-20 00:11:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:12,896 INFO L225 Difference]: With dead ends: 8498 [2024-11-20 00:11:12,896 INFO L226 Difference]: Without dead ends: 6014 [2024-11-20 00:11:12,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:12,903 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 580 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:12,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 583 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-11-20 00:11:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5062. [2024-11-20 00:11:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 4304 states have (on average 1.3322490706319703) internal successors, (5734), 4363 states have internal predecessors, (5734), 441 states have call successors, (441), 265 states have call predecessors, (441), 316 states have return successors, (595), 437 states have call predecessors, (595), 439 states have call successors, (595) [2024-11-20 00:11:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 6770 transitions. [2024-11-20 00:11:13,457 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 6770 transitions. Word has length 112 [2024-11-20 00:11:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:13,458 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 6770 transitions. [2024-11-20 00:11:13,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 6770 transitions. [2024-11-20 00:11:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 00:11:13,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:13,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:13,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:11:13,464 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -515412452, now seen corresponding path program 1 times [2024-11-20 00:11:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345860583] [2024-11-20 00:11:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:11:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-20 00:11:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345860583] [2024-11-20 00:11:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345860583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532372248] [2024-11-20 00:11:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:13,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:13,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:13,534 INFO L87 Difference]: Start difference. First operand 5062 states and 6770 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 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:11:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:14,173 INFO L93 Difference]: Finished difference Result 10042 states and 13426 transitions. [2024-11-20 00:11:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 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 112 [2024-11-20 00:11:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:14,192 INFO L225 Difference]: With dead ends: 10042 [2024-11-20 00:11:14,192 INFO L226 Difference]: Without dead ends: 4995 [2024-11-20 00:11:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:14,203 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 382 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 287 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:11:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2024-11-20 00:11:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4149. [2024-11-20 00:11:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 3536 states have (on average 1.3289027149321266) internal successors, (4699), 3586 states have internal predecessors, (4699), 352 states have call successors, (352), 213 states have call predecessors, (352), 260 states have return successors, (475), 351 states have call predecessors, (475), 350 states have call successors, (475) [2024-11-20 00:11:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5526 transitions. [2024-11-20 00:11:14,579 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5526 transitions. Word has length 112 [2024-11-20 00:11:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:14,580 INFO L471 AbstractCegarLoop]: Abstraction has 4149 states and 5526 transitions. [2024-11-20 00:11:14,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 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:11:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5526 transitions. [2024-11-20 00:11:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 00:11:14,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:14,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:11:14,585 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1689860065, now seen corresponding path program 1 times [2024-11-20 00:11:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350941093] [2024-11-20 00:11:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 00:11:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 00:11:14,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:14,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350941093] [2024-11-20 00:11:14,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350941093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:14,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:14,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540394939] [2024-11-20 00:11:14,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:14,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:14,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:14,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:14,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:14,782 INFO L87 Difference]: Start difference. First operand 4149 states and 5526 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:16,518 INFO L93 Difference]: Finished difference Result 13991 states and 18692 transitions. [2024-11-20 00:11:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:16,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 114 [2024-11-20 00:11:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:16,556 INFO L225 Difference]: With dead ends: 13991 [2024-11-20 00:11:16,556 INFO L226 Difference]: Without dead ends: 9857 [2024-11-20 00:11:16,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:16,572 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 791 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:16,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 421 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9857 states. [2024-11-20 00:11:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9857 to 8177. [2024-11-20 00:11:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 6901 states have (on average 1.316475873061875) internal successors, (9085), 7058 states have internal predecessors, (9085), 661 states have call successors, (661), 417 states have call predecessors, (661), 614 states have return successors, (1135), 705 states have call predecessors, (1135), 659 states have call successors, (1135) [2024-11-20 00:11:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 10881 transitions. [2024-11-20 00:11:17,355 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 10881 transitions. Word has length 114 [2024-11-20 00:11:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 10881 transitions. [2024-11-20 00:11:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 10881 transitions. [2024-11-20 00:11:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 00:11:17,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:17,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:17,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:11:17,363 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash -300566051, now seen corresponding path program 1 times [2024-11-20 00:11:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144502410] [2024-11-20 00:11:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 00:11:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-20 00:11:17,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144502410] [2024-11-20 00:11:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144502410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:17,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725226813] [2024-11-20 00:11:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:17,426 INFO L87 Difference]: Start difference. First operand 8177 states and 10881 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 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:11:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:18,650 INFO L93 Difference]: Finished difference Result 17955 states and 23908 transitions. [2024-11-20 00:11:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 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 114 [2024-11-20 00:11:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:18,680 INFO L225 Difference]: With dead ends: 17955 [2024-11-20 00:11:18,681 INFO L226 Difference]: Without dead ends: 9791 [2024-11-20 00:11:18,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:18,696 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 380 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:18,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 285 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:11:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9791 states. [2024-11-20 00:11:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9791 to 8171. [2024-11-20 00:11:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 6900 states have (on average 1.316376811594203) internal successors, (9083), 7056 states have internal predecessors, (9083), 656 states have call successors, (656), 417 states have call predecessors, (656), 614 states have return successors, (1127), 699 states have call predecessors, (1127), 654 states have call successors, (1127) [2024-11-20 00:11:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 10866 transitions. [2024-11-20 00:11:19,569 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 10866 transitions. Word has length 114 [2024-11-20 00:11:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 10866 transitions. [2024-11-20 00:11:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 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:11:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 10866 transitions. [2024-11-20 00:11:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 00:11:19,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:19,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:11:19,580 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1793795290, now seen corresponding path program 1 times [2024-11-20 00:11:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130940607] [2024-11-20 00:11:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 00:11:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 00:11:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130940607] [2024-11-20 00:11:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130940607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:19,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691647180] [2024-11-20 00:11:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:19,712 INFO L87 Difference]: Start difference. First operand 8171 states and 10866 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:22,500 INFO L93 Difference]: Finished difference Result 25543 states and 34550 transitions. [2024-11-20 00:11:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 00:11:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 116 [2024-11-20 00:11:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:22,549 INFO L225 Difference]: With dead ends: 25543 [2024-11-20 00:11:22,549 INFO L226 Difference]: Without dead ends: 14179 [2024-11-20 00:11:22,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-20 00:11:22,570 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1494 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:22,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 767 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:11:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2024-11-20 00:11:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12655. [2024-11-20 00:11:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12655 states, 10750 states have (on average 1.291720930232558) internal successors, (13886), 11000 states have internal predecessors, (13886), 938 states have call successors, (938), 617 states have call predecessors, (938), 966 states have return successors, (1813), 1039 states have call predecessors, (1813), 936 states have call successors, (1813) [2024-11-20 00:11:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12655 states to 12655 states and 16637 transitions. [2024-11-20 00:11:23,769 INFO L78 Accepts]: Start accepts. Automaton has 12655 states and 16637 transitions. Word has length 116 [2024-11-20 00:11:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:23,770 INFO L471 AbstractCegarLoop]: Abstraction has 12655 states and 16637 transitions. [2024-11-20 00:11:23,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 12655 states and 16637 transitions. [2024-11-20 00:11:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 00:11:23,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:23,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:23,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:11:23,782 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1100137730, now seen corresponding path program 1 times [2024-11-20 00:11:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144971454] [2024-11-20 00:11:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 00:11:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:11:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-20 00:11:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144971454] [2024-11-20 00:11:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144971454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820618134] [2024-11-20 00:11:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:23,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:23,862 INFO L87 Difference]: Start difference. First operand 12655 states and 16637 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 00:11:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:26,668 INFO L93 Difference]: Finished difference Result 34013 states and 44874 transitions. [2024-11-20 00:11:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:11:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2024-11-20 00:11:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:26,741 INFO L225 Difference]: With dead ends: 34013 [2024-11-20 00:11:26,742 INFO L226 Difference]: Without dead ends: 21371 [2024-11-20 00:11:26,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:26,767 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 492 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:26,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 374 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21371 states. [2024-11-20 00:11:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21371 to 18219. [2024-11-20 00:11:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18219 states, 15505 states have (on average 1.2799742018703644) internal successors, (19846), 15835 states have internal predecessors, (19846), 1367 states have call successors, (1367), 913 states have call predecessors, (1367), 1346 states have return successors, (2431), 1472 states have call predecessors, (2431), 1365 states have call successors, (2431) [2024-11-20 00:11:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18219 states to 18219 states and 23644 transitions. [2024-11-20 00:11:28,350 INFO L78 Accepts]: Start accepts. Automaton has 18219 states and 23644 transitions. Word has length 147 [2024-11-20 00:11:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:28,351 INFO L471 AbstractCegarLoop]: Abstraction has 18219 states and 23644 transitions. [2024-11-20 00:11:28,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 00:11:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18219 states and 23644 transitions. [2024-11-20 00:11:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:11:28,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:28,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:11:28,374 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:28,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -629341951, now seen corresponding path program 1 times [2024-11-20 00:11:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:28,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108334826] [2024-11-20 00:11:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:11:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:11:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-20 00:11:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108334826] [2024-11-20 00:11:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108334826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745192932] [2024-11-20 00:11:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:28,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:28,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 00:11:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:11:28,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-20 00:11:28,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745192932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:11:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732431449] [2024-11-20 00:11:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:28,741 INFO L87 Difference]: Start difference. First operand 18219 states and 23644 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:11:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:30,312 INFO L93 Difference]: Finished difference Result 37840 states and 49726 transitions. [2024-11-20 00:11:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2024-11-20 00:11:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:30,376 INFO L225 Difference]: With dead ends: 37840 [2024-11-20 00:11:30,377 INFO L226 Difference]: Without dead ends: 20155 [2024-11-20 00:11:30,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:30,421 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 151 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:30,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20155 states. [2024-11-20 00:11:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20155 to 18831. [2024-11-20 00:11:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18831 states, 16079 states have (on average 1.2466571304185583) internal successors, (20045), 16377 states have internal predecessors, (20045), 1391 states have call successors, (1391), 985 states have call predecessors, (1391), 1360 states have return successors, (2071), 1470 states have call predecessors, (2071), 1389 states have call successors, (2071) [2024-11-20 00:11:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 23507 transitions. [2024-11-20 00:11:32,756 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 23507 transitions. Word has length 168 [2024-11-20 00:11:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:32,756 INFO L471 AbstractCegarLoop]: Abstraction has 18831 states and 23507 transitions. [2024-11-20 00:11:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:11:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 23507 transitions. [2024-11-20 00:11:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:11:32,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:32,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:32,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 00:11:32,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-20 00:11:32,981 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:32,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1864691460, now seen corresponding path program 1 times [2024-11-20 00:11:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139430402] [2024-11-20 00:11:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:11:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:11:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-20 00:11:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139430402] [2024-11-20 00:11:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139430402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411248585] [2024-11-20 00:11:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:33,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:33,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:33,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:33,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 00:11:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:11:33,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-20 00:11:33,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411248585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:11:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284330076] [2024-11-20 00:11:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:33,329 INFO L87 Difference]: Start difference. First operand 18831 states and 23507 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:11:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:34,702 INFO L93 Difference]: Finished difference Result 31927 states and 39840 transitions. [2024-11-20 00:11:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2024-11-20 00:11:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:34,759 INFO L225 Difference]: With dead ends: 31927 [2024-11-20 00:11:34,759 INFO L226 Difference]: Without dead ends: 17557 [2024-11-20 00:11:34,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:34,792 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 153 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:34,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 526 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2024-11-20 00:11:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 17541. [2024-11-20 00:11:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17541 states, 15088 states have (on average 1.242709437963945) internal successors, (18750), 15386 states have internal predecessors, (18750), 1192 states have call successors, (1192), 881 states have call predecessors, (1192), 1260 states have return successors, (1784), 1275 states have call predecessors, (1784), 1190 states have call successors, (1784) [2024-11-20 00:11:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17541 states to 17541 states and 21726 transitions. [2024-11-20 00:11:36,275 INFO L78 Accepts]: Start accepts. Automaton has 17541 states and 21726 transitions. Word has length 168 [2024-11-20 00:11:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:36,276 INFO L471 AbstractCegarLoop]: Abstraction has 17541 states and 21726 transitions. [2024-11-20 00:11:36,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:11:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17541 states and 21726 transitions. [2024-11-20 00:11:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:11:36,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:36,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:36,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 00:11:36,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-20 00:11:36,490 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash -614519117, now seen corresponding path program 1 times [2024-11-20 00:11:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258648626] [2024-11-20 00:11:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:11:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:11:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:11:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-20 00:11:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258648626] [2024-11-20 00:11:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258648626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:36,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:36,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476249513] [2024-11-20 00:11:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:36,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:36,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:36,631 INFO L87 Difference]: Start difference. First operand 17541 states and 21726 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:38,856 INFO L93 Difference]: Finished difference Result 33377 states and 41430 transitions. [2024-11-20 00:11:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 168 [2024-11-20 00:11:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:38,908 INFO L225 Difference]: With dead ends: 33377 [2024-11-20 00:11:38,908 INFO L226 Difference]: Without dead ends: 21169 [2024-11-20 00:11:38,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:38,933 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 861 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:38,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 717 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21169 states. [2024-11-20 00:11:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21169 to 17541. [2024-11-20 00:11:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17541 states, 15088 states have (on average 1.23966065747614) internal successors, (18704), 15386 states have internal predecessors, (18704), 1192 states have call successors, (1192), 881 states have call predecessors, (1192), 1260 states have return successors, (1766), 1275 states have call predecessors, (1766), 1190 states have call successors, (1766) [2024-11-20 00:11:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17541 states to 17541 states and 21662 transitions. [2024-11-20 00:11:40,523 INFO L78 Accepts]: Start accepts. Automaton has 17541 states and 21662 transitions. Word has length 168 [2024-11-20 00:11:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:40,524 INFO L471 AbstractCegarLoop]: Abstraction has 17541 states and 21662 transitions. [2024-11-20 00:11:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 17541 states and 21662 transitions. [2024-11-20 00:11:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 00:11:40,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:40,531 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:40,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 00:11:40,532 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:40,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1488866448, now seen corresponding path program 1 times [2024-11-20 00:11:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629689077] [2024-11-20 00:11:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:11:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 00:11:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 00:11:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 00:11:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-20 00:11:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629689077] [2024-11-20 00:11:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629689077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:40,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790206629] [2024-11-20 00:11:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:40,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:40,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:40,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:40,657 INFO L87 Difference]: Start difference. First operand 17541 states and 21662 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-20 00:11:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:42,741 INFO L93 Difference]: Finished difference Result 34059 states and 42629 transitions. [2024-11-20 00:11:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:11:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 169 [2024-11-20 00:11:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:42,794 INFO L225 Difference]: With dead ends: 34059 [2024-11-20 00:11:42,794 INFO L226 Difference]: Without dead ends: 16531 [2024-11-20 00:11:42,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:42,822 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 402 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:42,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 349 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:11:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16531 states. [2024-11-20 00:11:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16531 to 14846. [2024-11-20 00:11:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14846 states, 12749 states have (on average 1.2139775668679897) internal successors, (15477), 12982 states have internal predecessors, (15477), 1007 states have call successors, (1007), 775 states have call predecessors, (1007), 1089 states have return successors, (1391), 1090 states have call predecessors, (1391), 1005 states have call successors, (1391) [2024-11-20 00:11:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14846 states to 14846 states and 17875 transitions. [2024-11-20 00:11:44,182 INFO L78 Accepts]: Start accepts. Automaton has 14846 states and 17875 transitions. Word has length 169 [2024-11-20 00:11:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 14846 states and 17875 transitions. [2024-11-20 00:11:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-20 00:11:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14846 states and 17875 transitions. [2024-11-20 00:11:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 00:11:44,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:44,189 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 00:11:44,189 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1637262977, now seen corresponding path program 1 times [2024-11-20 00:11:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799555544] [2024-11-20 00:11:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:11:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 00:11:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 00:11:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 00:11:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799555544] [2024-11-20 00:11:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799555544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794805683] [2024-11-20 00:11:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:44,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:44,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:44,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 00:11:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:44,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:44,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-20 00:11:44,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794805683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-20 00:11:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345575708] [2024-11-20 00:11:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:44,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:44,544 INFO L87 Difference]: Start difference. First operand 14846 states and 17875 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-20 00:11:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:45,561 INFO L93 Difference]: Finished difference Result 26854 states and 33018 transitions. [2024-11-20 00:11:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 169 [2024-11-20 00:11:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:45,614 INFO L225 Difference]: With dead ends: 26854 [2024-11-20 00:11:45,615 INFO L226 Difference]: Without dead ends: 13044 [2024-11-20 00:11:45,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:45,639 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 139 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:45,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13044 states. [2024-11-20 00:11:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13044 to 12900. [2024-11-20 00:11:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12900 states, 11133 states have (on average 1.192490793137519) internal successors, (13276), 11262 states have internal predecessors, (13276), 901 states have call successors, (901), 713 states have call predecessors, (901), 865 states have return successors, (1210), 926 states have call predecessors, (1210), 899 states have call successors, (1210) [2024-11-20 00:11:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 15387 transitions. [2024-11-20 00:11:46,584 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 15387 transitions. Word has length 169 [2024-11-20 00:11:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:46,584 INFO L471 AbstractCegarLoop]: Abstraction has 12900 states and 15387 transitions. [2024-11-20 00:11:46,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-20 00:11:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 15387 transitions. [2024-11-20 00:11:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-20 00:11:46,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:46,591 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:46,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 00:11:46,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:46,791 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:46,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1533230843, now seen corresponding path program 1 times [2024-11-20 00:11:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256193302] [2024-11-20 00:11:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:11:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 00:11:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 00:11:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-20 00:11:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256193302] [2024-11-20 00:11:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256193302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172867645] [2024-11-20 00:11:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:46,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:46,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:46,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 00:11:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:47,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 00:11:47,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172867645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275206946] [2024-11-20 00:11:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:47,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:47,067 INFO L87 Difference]: Start difference. First operand 12900 states and 15387 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:48,148 INFO L93 Difference]: Finished difference Result 22895 states and 27781 transitions. [2024-11-20 00:11:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 204 [2024-11-20 00:11:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:48,187 INFO L225 Difference]: With dead ends: 22895 [2024-11-20 00:11:48,187 INFO L226 Difference]: Without dead ends: 12732 [2024-11-20 00:11:48,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:48,198 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 139 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:48,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 447 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12732 states. [2024-11-20 00:11:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12732 to 12708. [2024-11-20 00:11:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12708 states, 10941 states have (on average 1.1715565304816744) internal successors, (12818), 11070 states have internal predecessors, (12818), 901 states have call successors, (901), 713 states have call predecessors, (901), 865 states have return successors, (1210), 926 states have call predecessors, (1210), 899 states have call successors, (1210) [2024-11-20 00:11:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12708 states to 12708 states and 14929 transitions. [2024-11-20 00:11:49,136 INFO L78 Accepts]: Start accepts. Automaton has 12708 states and 14929 transitions. Word has length 204 [2024-11-20 00:11:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 12708 states and 14929 transitions. [2024-11-20 00:11:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12708 states and 14929 transitions. [2024-11-20 00:11:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 00:11:49,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:49,144 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:49,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 00:11:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:49,345 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1236898553, now seen corresponding path program 1 times [2024-11-20 00:11:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219586448] [2024-11-20 00:11:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 00:11:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-20 00:11:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-20 00:11:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219586448] [2024-11-20 00:11:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219586448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183895579] [2024-11-20 00:11:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:49,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:49,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 00:11:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:49,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-20 00:11:49,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183895579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:49,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383553844] [2024-11-20 00:11:49,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:49,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:49,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:49,605 INFO L87 Difference]: Start difference. First operand 12708 states and 14929 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:50,527 INFO L93 Difference]: Finished difference Result 22195 states and 26503 transitions. [2024-11-20 00:11:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:50,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 206 [2024-11-20 00:11:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:50,560 INFO L225 Difference]: With dead ends: 22195 [2024-11-20 00:11:50,560 INFO L226 Difference]: Without dead ends: 12224 [2024-11-20 00:11:50,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:50,574 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 159 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:50,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 434 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2024-11-20 00:11:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12212. [2024-11-20 00:11:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12212 states, 10501 states have (on average 1.1555089991429388) internal successors, (12134), 10614 states have internal predecessors, (12134), 877 states have call successors, (877), 689 states have call predecessors, (877), 833 states have return successors, (1178), 910 states have call predecessors, (1178), 875 states have call successors, (1178) [2024-11-20 00:11:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 14189 transitions. [2024-11-20 00:11:51,576 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 14189 transitions. Word has length 206 [2024-11-20 00:11:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 12212 states and 14189 transitions. [2024-11-20 00:11:51,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 14189 transitions. [2024-11-20 00:11:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 00:11:51,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:51,583 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:51,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:51,783 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:51,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 779520488, now seen corresponding path program 1 times [2024-11-20 00:11:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150264862] [2024-11-20 00:11:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 00:11:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 00:11:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 56 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-20 00:11:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150264862] [2024-11-20 00:11:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150264862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788667336] [2024-11-20 00:11:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:51,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:51,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 00:11:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:52,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-20 00:11:52,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788667336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520027225] [2024-11-20 00:11:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:52,107 INFO L87 Difference]: Start difference. First operand 12212 states and 14189 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:52,985 INFO L93 Difference]: Finished difference Result 21117 states and 24850 transitions. [2024-11-20 00:11:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 207 [2024-11-20 00:11:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:53,030 INFO L225 Difference]: With dead ends: 21117 [2024-11-20 00:11:53,030 INFO L226 Difference]: Without dead ends: 12236 [2024-11-20 00:11:53,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:53,046 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 109 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:53,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 444 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12236 states. [2024-11-20 00:11:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12236 to 12208. [2024-11-20 00:11:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12208 states, 10497 states have (on average 1.1370867867009622) internal successors, (11936), 10610 states have internal predecessors, (11936), 877 states have call successors, (877), 689 states have call predecessors, (877), 833 states have return successors, (1178), 910 states have call predecessors, (1178), 875 states have call successors, (1178) [2024-11-20 00:11:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12208 states to 12208 states and 13991 transitions. [2024-11-20 00:11:54,104 INFO L78 Accepts]: Start accepts. Automaton has 12208 states and 13991 transitions. Word has length 207 [2024-11-20 00:11:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 12208 states and 13991 transitions. [2024-11-20 00:11:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12208 states and 13991 transitions. [2024-11-20 00:11:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 00:11:54,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:54,111 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:54,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:54,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:54,312 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:54,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash -404906680, now seen corresponding path program 1 times [2024-11-20 00:11:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739073415] [2024-11-20 00:11:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:11:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 00:11:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 00:11:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739073415] [2024-11-20 00:11:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739073415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143322775] [2024-11-20 00:11:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:54,504 INFO L87 Difference]: Start difference. First operand 12208 states and 13991 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:58,047 INFO L93 Difference]: Finished difference Result 40475 states and 47272 transitions. [2024-11-20 00:11:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 209 [2024-11-20 00:11:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:58,128 INFO L225 Difference]: With dead ends: 40475 [2024-11-20 00:11:58,128 INFO L226 Difference]: Without dead ends: 33335 [2024-11-20 00:11:58,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:58,142 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 975 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:58,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1057 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33335 states. [2024-11-20 00:12:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33335 to 24053. [2024-11-20 00:12:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24053 states, 20643 states have (on average 1.1415007508598556) internal successors, (23564), 20906 states have internal predecessors, (23564), 1732 states have call successors, (1732), 1355 states have call predecessors, (1732), 1677 states have return successors, (2430), 1793 states have call predecessors, (2430), 1730 states have call successors, (2430) [2024-11-20 00:12:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24053 states to 24053 states and 27726 transitions. [2024-11-20 00:12:00,323 INFO L78 Accepts]: Start accepts. Automaton has 24053 states and 27726 transitions. Word has length 209 [2024-11-20 00:12:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:00,324 INFO L471 AbstractCegarLoop]: Abstraction has 24053 states and 27726 transitions. [2024-11-20 00:12:00,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:12:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 24053 states and 27726 transitions. [2024-11-20 00:12:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-20 00:12:00,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:00,330 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:12:00,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 00:12:00,330 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:00,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1948098800, now seen corresponding path program 1 times [2024-11-20 00:12:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98545792] [2024-11-20 00:12:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:12:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:12:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:12:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:12:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:12:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:12:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:12:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:12:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:12:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:12:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:12:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 00:12:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-20 00:12:00,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:00,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98545792] [2024-11-20 00:12:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98545792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:00,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:12:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875254721] [2024-11-20 00:12:00,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:00,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:12:00,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:12:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:12:00,422 INFO L87 Difference]: Start difference. First operand 24053 states and 27726 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 00:12:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:02,963 INFO L93 Difference]: Finished difference Result 45184 states and 52467 transitions. [2024-11-20 00:12:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:12:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 213 [2024-11-20 00:12:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted.