./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_1.cil-2+token_ring.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:07:14,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:07:14,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:07:14,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:07:14,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:07:14,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:07:14,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:07:14,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:07:14,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:07:14,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:07:14,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:07:14,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:07:14,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:07:14,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:07:14,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:07:14,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:07:14,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:07:14,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:07:14,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:07:14,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:07:14,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:07:14,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:07:14,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:07:14,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:07:14,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:07:14,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:07:14,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:07:14,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:07:14,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:07:14,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:07:14,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:07:14,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:07:14,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:07:14,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:07:14,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:07:14,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:07:14,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:07:14,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:07:14,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:07:14,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:07:14,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:07:14,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:07:14,808 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 -> a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 [2024-11-20 00:07:15,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:07:15,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:07:15,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:07:15,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:07:15,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:07:15,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-20 00:07:16,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:07:16,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:07:16,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-20 00:07:16,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285de5d48/913e76cb7be349319a23a6a89273afbf/FLAG7923b0ab0 [2024-11-20 00:07:16,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285de5d48/913e76cb7be349319a23a6a89273afbf [2024-11-20 00:07:16,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:07:16,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:07:16,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:07:16,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:07:16,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:07:16,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:16" (1/1) ... [2024-11-20 00:07:16,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718ba94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:16, skipping insertion in model container [2024-11-20 00:07:16,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:16" (1/1) ... [2024-11-20 00:07:16,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:07:17,013 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_1.cil-2+token_ring.15.cil.c[913,926] [2024-11-20 00:07:17,063 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_1.cil-2+token_ring.15.cil.c[5977,5990] [2024-11-20 00:07:17,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:07:17,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:07:17,207 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_1.cil-2+token_ring.15.cil.c[913,926] [2024-11-20 00:07:17,221 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_1.cil-2+token_ring.15.cil.c[5977,5990] [2024-11-20 00:07:17,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:07:17,302 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:07:17,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17 WrapperNode [2024-11-20 00:07:17,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:07:17,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:07:17,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:07:17,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:07:17,310 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:07:17" (1/1) ... [2024-11-20 00:07:17,356 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:07:17" (1/1) ... [2024-11-20 00:07:17,412 INFO L138 Inliner]: procedures = 74, calls = 88, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1147 [2024-11-20 00:07:17,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:07:17,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:07:17,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:07:17,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:07:17,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,468 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:07:17,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:07:17,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:07:17,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:07:17,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:07:17,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (1/1) ... [2024-11-20 00:07:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:07:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:17,609 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:07:17,617 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:07:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:07:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:07:17,653 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:07:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-20 00:07:17,653 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:07:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:07:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:07:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:07:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:07:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:07:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:07:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:07:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:07:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:07:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:07:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:07:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:07:17,657 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:07:17,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:07:17,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:07:18,608 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-20 00:07:18,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:07:18,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:07:18,635 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-20 00:07:18,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:18 BoogieIcfgContainer [2024-11-20 00:07:18,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:07:18,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:07:18,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:07:18,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:07:18,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:07:16" (1/3) ... [2024-11-20 00:07:18,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfee3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:18, skipping insertion in model container [2024-11-20 00:07:18,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:17" (2/3) ... [2024-11-20 00:07:18,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfee3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:18, skipping insertion in model container [2024-11-20 00:07:18,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:18" (3/3) ... [2024-11-20 00:07:18,643 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-20 00:07:18,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:07:18,655 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:07:18,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:07:18,722 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;@15b165b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:07:18,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:07:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 451 states have (on average 1.6341463414634145) internal successors, (737), 458 states have internal predecessors, (737), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 00:07:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 00:07:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:18,743 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] [2024-11-20 00:07:18,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:18,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash -960930593, now seen corresponding path program 1 times [2024-11-20 00:07:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142732483] [2024-11-20 00:07:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-20 00:07:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:19,055 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:07:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142732483] [2024-11-20 00:07:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142732483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505369518] [2024-11-20 00:07:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:19,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:19,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:19,116 INFO L87 Difference]: Start difference. First operand has 499 states, 451 states have (on average 1.6341463414634145) internal successors, (737), 458 states have internal predecessors, (737), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 00:07:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:19,762 INFO L93 Difference]: Finished difference Result 979 states and 1579 transitions. [2024-11-20 00:07:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-20 00:07:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:19,774 INFO L225 Difference]: With dead ends: 979 [2024-11-20 00:07:19,774 INFO L226 Difference]: Without dead ends: 497 [2024-11-20 00:07:19,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:19,784 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 408 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:19,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1191 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:07:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-20 00:07:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 488. [2024-11-20 00:07:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 443 states have (on average 1.5440180586907448) internal successors, (684), 447 states have internal predecessors, (684), 35 states have call successors, (35), 10 states have call predecessors, (35), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 00:07:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 750 transitions. [2024-11-20 00:07:19,857 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 750 transitions. Word has length 44 [2024-11-20 00:07:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 750 transitions. [2024-11-20 00:07:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 00:07:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 750 transitions. [2024-11-20 00:07:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 00:07:19,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:19,860 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] [2024-11-20 00:07:19,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:07:19,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 884436573, now seen corresponding path program 1 times [2024-11-20 00:07:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865308221] [2024-11-20 00:07:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:19,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-20 00:07:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:19,969 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:07:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865308221] [2024-11-20 00:07:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865308221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270648038] [2024-11-20 00:07:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:19,979 INFO L87 Difference]: Start difference. First operand 488 states and 750 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:20,383 INFO L93 Difference]: Finished difference Result 620 states and 935 transitions. [2024-11-20 00:07:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-20 00:07:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:20,387 INFO L225 Difference]: With dead ends: 620 [2024-11-20 00:07:20,387 INFO L226 Difference]: Without dead ends: 558 [2024-11-20 00:07:20,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:20,388 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1017 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:20,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 899 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:07:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-20 00:07:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 552. [2024-11-20 00:07:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 500 states have (on average 1.52) internal successors, (760), 505 states have internal predecessors, (760), 39 states have call successors, (39), 12 states have call predecessors, (39), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2024-11-20 00:07:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 840 transitions. [2024-11-20 00:07:20,415 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 840 transitions. Word has length 44 [2024-11-20 00:07:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:20,415 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 840 transitions. [2024-11-20 00:07:20,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 840 transitions. [2024-11-20 00:07:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:07:20,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:20,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:20,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:07:20,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1727302649, now seen corresponding path program 1 times [2024-11-20 00:07:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215815822] [2024-11-20 00:07:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:07:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:20,486 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:07:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215815822] [2024-11-20 00:07:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215815822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982124985] [2024-11-20 00:07:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:20,488 INFO L87 Difference]: Start difference. First operand 552 states and 840 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:20,967 INFO L93 Difference]: Finished difference Result 800 states and 1180 transitions. [2024-11-20 00:07:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-20 00:07:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:20,973 INFO L225 Difference]: With dead ends: 800 [2024-11-20 00:07:20,973 INFO L226 Difference]: Without dead ends: 676 [2024-11-20 00:07:20,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:20,975 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 389 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:20,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1294 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:07:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-20 00:07:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 619. [2024-11-20 00:07:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 561 states have (on average 1.5044563279857397) internal successors, (844), 566 states have internal predecessors, (844), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (44), 38 states have call predecessors, (44), 38 states have call successors, (44) [2024-11-20 00:07:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 930 transitions. [2024-11-20 00:07:20,996 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 930 transitions. Word has length 45 [2024-11-20 00:07:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:20,996 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 930 transitions. [2024-11-20 00:07:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 930 transitions. [2024-11-20 00:07:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:07:20,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:20,998 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] [2024-11-20 00:07:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:07:20,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 442945188, now seen corresponding path program 1 times [2024-11-20 00:07:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558932553] [2024-11-20 00:07:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:07:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,057 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:07:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558932553] [2024-11-20 00:07:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558932553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96075711] [2024-11-20 00:07:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:21,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:21,061 INFO L87 Difference]: Start difference. First operand 619 states and 930 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:21,501 INFO L93 Difference]: Finished difference Result 1027 states and 1489 transitions. [2024-11-20 00:07:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-20 00:07:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:21,507 INFO L225 Difference]: With dead ends: 1027 [2024-11-20 00:07:21,507 INFO L226 Difference]: Without dead ends: 836 [2024-11-20 00:07:21,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:21,510 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 1035 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:21,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 922 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:07:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-20 00:07:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2024-11-20 00:07:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 707 states have (on average 1.4625176803394626) internal successors, (1034), 715 states have internal predecessors, (1034), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (61), 47 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-20 00:07:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1148 transitions. [2024-11-20 00:07:21,548 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1148 transitions. Word has length 45 [2024-11-20 00:07:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:21,549 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1148 transitions. [2024-11-20 00:07:21,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 00:07:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1148 transitions. [2024-11-20 00:07:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 00:07:21,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:21,555 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:07:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:07:21,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:21,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -369711155, now seen corresponding path program 1 times [2024-11-20 00:07:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:21,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365410643] [2024-11-20 00:07:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 00:07:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:07:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 00:07:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365410643] [2024-11-20 00:07:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365410643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:21,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081422986] [2024-11-20 00:07:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:21,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:21,620 INFO L87 Difference]: Start difference. First operand 784 states and 1148 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:07:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:22,143 INFO L93 Difference]: Finished difference Result 1128 states and 1609 transitions. [2024-11-20 00:07:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:22,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-20 00:07:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:22,147 INFO L225 Difference]: With dead ends: 1128 [2024-11-20 00:07:22,148 INFO L226 Difference]: Without dead ends: 891 [2024-11-20 00:07:22,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:22,149 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 373 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:22,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1345 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:07:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-20 00:07:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 853. [2024-11-20 00:07:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 767 states have (on average 1.439374185136897) internal successors, (1104), 776 states have internal predecessors, (1104), 58 states have call successors, (58), 25 states have call predecessors, (58), 26 states have return successors, (70), 52 states have call predecessors, (70), 54 states have call successors, (70) [2024-11-20 00:07:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1232 transitions. [2024-11-20 00:07:22,182 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1232 transitions. Word has length 62 [2024-11-20 00:07:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:22,182 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1232 transitions. [2024-11-20 00:07:22,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:07:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1232 transitions. [2024-11-20 00:07:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:07:22,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:22,184 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:07:22,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:07:22,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1273953958, now seen corresponding path program 1 times [2024-11-20 00:07:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961312803] [2024-11-20 00:07:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:07:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 00:07:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961312803] [2024-11-20 00:07:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961312803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:22,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:07:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544822814] [2024-11-20 00:07:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:22,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:07:22,301 INFO L87 Difference]: Start difference. First operand 853 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:07:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:22,749 INFO L93 Difference]: Finished difference Result 1404 states and 1954 transitions. [2024-11-20 00:07:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:07:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-20 00:07:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:22,754 INFO L225 Difference]: With dead ends: 1404 [2024-11-20 00:07:22,754 INFO L226 Difference]: Without dead ends: 1026 [2024-11-20 00:07:22,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:22,756 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1022 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:22,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 921 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:07:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-20 00:07:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 971. [2024-11-20 00:07:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 872 states have (on average 1.4105504587155964) internal successors, (1230), 882 states have internal predecessors, (1230), 65 states have call successors, (65), 30 states have call predecessors, (65), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-11-20 00:07:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1376 transitions. [2024-11-20 00:07:22,801 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1376 transitions. Word has length 67 [2024-11-20 00:07:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:22,802 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1376 transitions. [2024-11-20 00:07:22,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:07:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1376 transitions. [2024-11-20 00:07:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:07:22,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:22,803 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:07:22,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:07:22,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -991698967, now seen corresponding path program 1 times [2024-11-20 00:07:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:22,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807083169] [2024-11-20 00:07:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:07:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:07:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 00:07:22,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807083169] [2024-11-20 00:07:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807083169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816001031] [2024-11-20 00:07:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:22,882 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:07:22,884 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:07:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:22,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:07:22,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:07:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:07:23,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:07:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816001031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:07:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:07:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604428213] [2024-11-20 00:07:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:23,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:07:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:07:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:23,005 INFO L87 Difference]: Start difference. First operand 971 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:07:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:23,040 INFO L93 Difference]: Finished difference Result 1414 states and 1971 transitions. [2024-11-20 00:07:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:07:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2024-11-20 00:07:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:23,043 INFO L225 Difference]: With dead ends: 1414 [2024-11-20 00:07:23,043 INFO L226 Difference]: Without dead ends: 969 [2024-11-20 00:07:23,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:23,045 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 72 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:23,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1521 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:07:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-20 00:07:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 925. [2024-11-20 00:07:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 832 states have (on average 1.4038461538461537) internal successors, (1168), 842 states have internal predecessors, (1168), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-11-20 00:07:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1304 transitions. [2024-11-20 00:07:23,073 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1304 transitions. Word has length 68 [2024-11-20 00:07:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1304 transitions. [2024-11-20 00:07:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 00:07:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1304 transitions. [2024-11-20 00:07:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:07:23,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:23,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:23,085 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:07:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:23,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1188272808, now seen corresponding path program 1 times [2024-11-20 00:07:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870487714] [2024-11-20 00:07:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:07:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:07:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:07:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:23,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870487714] [2024-11-20 00:07:23,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870487714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:23,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102791033] [2024-11-20 00:07:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:23,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:23,365 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:07:23,366 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:07:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:23,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 00:07:23,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:07:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:07:23,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:07:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:07:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102791033] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:23,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 00:07:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-20 00:07:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411109957] [2024-11-20 00:07:23,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:23,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:07:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:07:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:07:23,581 INFO L87 Difference]: Start difference. First operand 925 states and 1304 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:07:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:23,772 INFO L93 Difference]: Finished difference Result 976 states and 1365 transitions. [2024-11-20 00:07:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:07:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-20 00:07:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:23,779 INFO L225 Difference]: With dead ends: 976 [2024-11-20 00:07:23,779 INFO L226 Difference]: Without dead ends: 973 [2024-11-20 00:07:23,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:07:23,781 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1371 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:23,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 836 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:07:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-20 00:07:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 924. [2024-11-20 00:07:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 832 states have (on average 1.4014423076923077) internal successors, (1166), 841 states have internal predecessors, (1166), 60 states have call successors, (60), 28 states have call predecessors, (60), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-11-20 00:07:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1301 transitions. [2024-11-20 00:07:23,818 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1301 transitions. Word has length 68 [2024-11-20 00:07:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:23,818 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1301 transitions. [2024-11-20 00:07:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:07:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1301 transitions. [2024-11-20 00:07:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:07:23,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:23,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:23,828 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:07:24,023 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,SelfDestructingSolverStorable7 [2024-11-20 00:07:24,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:24,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1819744823, now seen corresponding path program 1 times [2024-11-20 00:07:24,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:24,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366004313] [2024-11-20 00:07:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:07:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:07:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:07:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366004313] [2024-11-20 00:07:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366004313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492649214] [2024-11-20 00:07:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:24,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:24,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:24,094 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:07:24,095 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:07:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:24,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:07:24,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:07:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:07:24,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:07:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:07:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492649214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:07:24,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:07:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-20 00:07:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950336991] [2024-11-20 00:07:24,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:07:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 00:07:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:24,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 00:07:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:07:24,420 INFO L87 Difference]: Start difference. First operand 924 states and 1301 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:07:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:25,719 INFO L93 Difference]: Finished difference Result 2080 states and 2803 transitions. [2024-11-20 00:07:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:07:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-20 00:07:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:25,726 INFO L225 Difference]: With dead ends: 2080 [2024-11-20 00:07:25,726 INFO L226 Difference]: Without dead ends: 1684 [2024-11-20 00:07:25,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-20 00:07:25,729 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 1192 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:25,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 4002 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:07:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-11-20 00:07:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1262. [2024-11-20 00:07:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1134 states have (on average 1.3518518518518519) internal successors, (1533), 1149 states have internal predecessors, (1533), 79 states have call successors, (79), 41 states have call predecessors, (79), 47 states have return successors, (106), 72 states have call predecessors, (106), 76 states have call successors, (106) [2024-11-20 00:07:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1718 transitions. [2024-11-20 00:07:25,797 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1718 transitions. Word has length 69 [2024-11-20 00:07:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:25,797 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1718 transitions. [2024-11-20 00:07:25,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:07:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1718 transitions. [2024-11-20 00:07:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 00:07:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:25,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-20 00:07:25,810 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:07:26,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:26,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1621511759, now seen corresponding path program 1 times [2024-11-20 00:07:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121004858] [2024-11-20 00:07:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:07:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:07:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:07:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-20 00:07:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121004858] [2024-11-20 00:07:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121004858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633628128] [2024-11-20 00:07:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:26,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:26,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:26,095 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:07:26,096 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:07:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:07:26,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:07:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:07:26,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:07:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633628128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:26,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:07:26,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:07:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869637374] [2024-11-20 00:07:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:07:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:07:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:26,212 INFO L87 Difference]: Start difference. First operand 1262 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:07:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:26,254 INFO L93 Difference]: Finished difference Result 1848 states and 2462 transitions. [2024-11-20 00:07:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:07:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-20 00:07:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:26,258 INFO L225 Difference]: With dead ends: 1848 [2024-11-20 00:07:26,258 INFO L226 Difference]: Without dead ends: 1202 [2024-11-20 00:07:26,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:26,260 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 709 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 850 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:07:26,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 850 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:07:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-20 00:07:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1196. [2024-11-20 00:07:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1075 states have (on average 1.3488372093023255) internal successors, (1450), 1090 states have internal predecessors, (1450), 76 states have call successors, (76), 38 states have call predecessors, (76), 43 states have return successors, (101), 68 states have call predecessors, (101), 73 states have call successors, (101) [2024-11-20 00:07:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1627 transitions. [2024-11-20 00:07:26,300 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1627 transitions. Word has length 88 [2024-11-20 00:07:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:26,300 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1627 transitions. [2024-11-20 00:07:26,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:07:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1627 transitions. [2024-11-20 00:07:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 00:07:26,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:26,302 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:07:26,310 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:07:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:26,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:26,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash 671467825, now seen corresponding path program 1 times [2024-11-20 00:07:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:26,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995495783] [2024-11-20 00:07:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:07:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:07:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 00:07:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 00:07:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:07:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 00:07:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995495783] [2024-11-20 00:07:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995495783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:07:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550744126] [2024-11-20 00:07:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:07:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:07:26,695 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:07:26,702 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:07:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:26,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:07:26,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:07:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 00:07:26,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:07:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550744126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:07:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:07:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460921414] [2024-11-20 00:07:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:07:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:07:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:26,828 INFO L87 Difference]: Start difference. First operand 1196 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-20 00:07:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:26,882 INFO L93 Difference]: Finished difference Result 1506 states and 2008 transitions. [2024-11-20 00:07:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:07:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-20 00:07:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:26,885 INFO L225 Difference]: With dead ends: 1506 [2024-11-20 00:07:26,885 INFO L226 Difference]: Without dead ends: 422 [2024-11-20 00:07:26,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:26,888 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 60 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:26,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:07:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-20 00:07:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2024-11-20 00:07:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5621761658031088) internal successors, (603), 388 states have internal predecessors, (603), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 00:07:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 659 transitions. [2024-11-20 00:07:26,900 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 659 transitions. Word has length 103 [2024-11-20 00:07:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 659 transitions. [2024-11-20 00:07:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-20 00:07:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 659 transitions. [2024-11-20 00:07:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:26,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:26,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:26,910 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:07:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 00:07:27,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1255778744, now seen corresponding path program 1 times [2024-11-20 00:07:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329492172] [2024-11-20 00:07:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:27,265 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:07:27,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329492172] [2024-11-20 00:07:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329492172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:07:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386689058] [2024-11-20 00:07:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:27,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:07:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:07:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:27,267 INFO L87 Difference]: Start difference. First operand 422 states and 659 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:07:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:28,752 INFO L93 Difference]: Finished difference Result 988 states and 1569 transitions. [2024-11-20 00:07:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:07:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-20 00:07:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:28,755 INFO L225 Difference]: With dead ends: 988 [2024-11-20 00:07:28,755 INFO L226 Difference]: Without dead ends: 575 [2024-11-20 00:07:28,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:07:28,756 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1131 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:28,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 843 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:07:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-20 00:07:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 422. [2024-11-20 00:07:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5595854922279793) internal successors, (602), 388 states have internal predecessors, (602), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 00:07:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 658 transitions. [2024-11-20 00:07:28,796 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 658 transitions. Word has length 190 [2024-11-20 00:07:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:28,796 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 658 transitions. [2024-11-20 00:07:28,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:07:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 658 transitions. [2024-11-20 00:07:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:28,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:28,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:28,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:07:28,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1728118390, now seen corresponding path program 1 times [2024-11-20 00:07:28,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:28,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953546512] [2024-11-20 00:07:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:28,975 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:07:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953546512] [2024-11-20 00:07:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953546512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:07:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668982862] [2024-11-20 00:07:28,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:07:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:28,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:07:28,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:07:28,977 INFO L87 Difference]: Start difference. First operand 422 states and 658 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:07:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:30,462 INFO L93 Difference]: Finished difference Result 980 states and 1552 transitions. [2024-11-20 00:07:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:07:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-20 00:07:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:30,465 INFO L225 Difference]: With dead ends: 980 [2024-11-20 00:07:30,465 INFO L226 Difference]: Without dead ends: 575 [2024-11-20 00:07:30,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:07:30,466 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1122 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:30,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 841 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:07:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-20 00:07:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 422. [2024-11-20 00:07:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5569948186528497) internal successors, (601), 388 states have internal predecessors, (601), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 00:07:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 657 transitions. [2024-11-20 00:07:30,483 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 657 transitions. Word has length 190 [2024-11-20 00:07:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 657 transitions. [2024-11-20 00:07:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:07:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 657 transitions. [2024-11-20 00:07:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:30,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:30,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:30,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:07:30,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -359657780, now seen corresponding path program 1 times [2024-11-20 00:07:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256903728] [2024-11-20 00:07:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:30,714 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:07:30,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256903728] [2024-11-20 00:07:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256903728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:30,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:07:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559280800] [2024-11-20 00:07:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:07:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:30,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:07:30,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:07:30,715 INFO L87 Difference]: Start difference. First operand 422 states and 657 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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:07:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:33,393 INFO L93 Difference]: Finished difference Result 1548 states and 2468 transitions. [2024-11-20 00:07:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:07:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:33,397 INFO L225 Difference]: With dead ends: 1548 [2024-11-20 00:07:33,397 INFO L226 Difference]: Without dead ends: 1148 [2024-11-20 00:07:33,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:07:33,399 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1701 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:33,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1440 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 00:07:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-20 00:07:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 841. [2024-11-20 00:07:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 776 states have (on average 1.5695876288659794) internal successors, (1218), 779 states have internal predecessors, (1218), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-20 00:07:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1321 transitions. [2024-11-20 00:07:33,433 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1321 transitions. Word has length 190 [2024-11-20 00:07:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:33,433 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1321 transitions. [2024-11-20 00:07:33,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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:07:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1321 transitions. [2024-11-20 00:07:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:33,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:33,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:07:33,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2088283080, now seen corresponding path program 1 times [2024-11-20 00:07:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888798291] [2024-11-20 00:07:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:33,675 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:07:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888798291] [2024-11-20 00:07:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888798291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:33,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817581851] [2024-11-20 00:07:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:33,676 INFO L87 Difference]: Start difference. First operand 841 states and 1321 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:37,159 INFO L93 Difference]: Finished difference Result 2560 states and 4091 transitions. [2024-11-20 00:07:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:07:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:37,165 INFO L225 Difference]: With dead ends: 2560 [2024-11-20 00:07:37,165 INFO L226 Difference]: Without dead ends: 1741 [2024-11-20 00:07:37,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:07:37,168 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1736 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3867 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:37,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 2803 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3867 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 00:07:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2024-11-20 00:07:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1231. [2024-11-20 00:07:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1137 states have (on average 1.5628847845206684) internal successors, (1777), 1141 states have internal predecessors, (1777), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-20 00:07:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1926 transitions. [2024-11-20 00:07:37,257 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1926 transitions. Word has length 190 [2024-11-20 00:07:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:37,258 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1926 transitions. [2024-11-20 00:07:37,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1926 transitions. [2024-11-20 00:07:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:37,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:37,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:07:37,261 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash 165032650, now seen corresponding path program 1 times [2024-11-20 00:07:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383664637] [2024-11-20 00:07:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:37,571 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:07:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383664637] [2024-11-20 00:07:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383664637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898300722] [2024-11-20 00:07:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:37,574 INFO L87 Difference]: Start difference. First operand 1231 states and 1926 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:41,028 INFO L93 Difference]: Finished difference Result 4053 states and 6464 transitions. [2024-11-20 00:07:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:07:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:41,037 INFO L225 Difference]: With dead ends: 4053 [2024-11-20 00:07:41,037 INFO L226 Difference]: Without dead ends: 2844 [2024-11-20 00:07:41,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:07:41,041 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1734 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:41,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2801 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 00:07:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-11-20 00:07:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2012. [2024-11-20 00:07:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1860 states have (on average 1.5569892473118279) internal successors, (2896), 1866 states have internal predecessors, (2896), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-20 00:07:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3141 transitions. [2024-11-20 00:07:41,131 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3141 transitions. Word has length 190 [2024-11-20 00:07:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3141 transitions. [2024-11-20 00:07:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3141 transitions. [2024-11-20 00:07:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:41,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:07:41,134 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1559575672, now seen corresponding path program 1 times [2024-11-20 00:07:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642266976] [2024-11-20 00:07:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:41,367 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:07:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642266976] [2024-11-20 00:07:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642266976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306588178] [2024-11-20 00:07:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:41,369 INFO L87 Difference]: Start difference. First operand 2012 states and 3141 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:43,133 INFO L93 Difference]: Finished difference Result 4822 states and 7670 transitions. [2024-11-20 00:07:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:07:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:43,144 INFO L225 Difference]: With dead ends: 4822 [2024-11-20 00:07:43,144 INFO L226 Difference]: Without dead ends: 2832 [2024-11-20 00:07:43,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:07:43,148 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1425 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:43,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1185 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:07:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-20 00:07:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2012. [2024-11-20 00:07:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1860 states have (on average 1.5543010752688171) internal successors, (2891), 1866 states have internal predecessors, (2891), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-20 00:07:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3136 transitions. [2024-11-20 00:07:43,246 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3136 transitions. Word has length 190 [2024-11-20 00:07:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3136 transitions. [2024-11-20 00:07:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3136 transitions. [2024-11-20 00:07:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:43,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:43,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:07:43,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:43,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1061018870, now seen corresponding path program 1 times [2024-11-20 00:07:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744850476] [2024-11-20 00:07:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:43,510 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:07:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744850476] [2024-11-20 00:07:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744850476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693956737] [2024-11-20 00:07:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:43,512 INFO L87 Difference]: Start difference. First operand 2012 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:46,779 INFO L93 Difference]: Finished difference Result 6915 states and 10957 transitions. [2024-11-20 00:07:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:07:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:46,795 INFO L225 Difference]: With dead ends: 6915 [2024-11-20 00:07:46,795 INFO L226 Difference]: Without dead ends: 4925 [2024-11-20 00:07:46,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:07:46,798 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1848 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:46,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1778 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 00:07:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2024-11-20 00:07:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 3584. [2024-11-20 00:07:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3316 states have (on average 1.5500603136308806) internal successors, (5140), 3326 states have internal predecessors, (5140), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-20 00:07:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5583 transitions. [2024-11-20 00:07:46,960 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5583 transitions. Word has length 190 [2024-11-20 00:07:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:46,960 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5583 transitions. [2024-11-20 00:07:46,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5583 transitions. [2024-11-20 00:07:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:46,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:46,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:46,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:07:46,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 342850316, now seen corresponding path program 1 times [2024-11-20 00:07:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367686479] [2024-11-20 00:07:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:47,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:07:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:47,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367686479] [2024-11-20 00:07:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367686479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752736073] [2024-11-20 00:07:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:47,184 INFO L87 Difference]: Start difference. First operand 3584 states and 5583 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:49,185 INFO L93 Difference]: Finished difference Result 8517 states and 13490 transitions. [2024-11-20 00:07:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:07:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:49,198 INFO L225 Difference]: With dead ends: 8517 [2024-11-20 00:07:49,199 INFO L226 Difference]: Without dead ends: 4955 [2024-11-20 00:07:49,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:07:49,205 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1243 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:49,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1411 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:07:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2024-11-20 00:07:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3584. [2024-11-20 00:07:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3316 states have (on average 1.5473462002412546) internal successors, (5131), 3326 states have internal predecessors, (5131), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-20 00:07:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5574 transitions. [2024-11-20 00:07:49,378 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5574 transitions. Word has length 190 [2024-11-20 00:07:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:49,378 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5574 transitions. [2024-11-20 00:07:49,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5574 transitions. [2024-11-20 00:07:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:49,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:49,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:49,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:07:49,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -443147574, now seen corresponding path program 1 times [2024-11-20 00:07:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093970999] [2024-11-20 00:07:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:49,607 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:07:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093970999] [2024-11-20 00:07:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093970999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516208667] [2024-11-20 00:07:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:49,611 INFO L87 Difference]: Start difference. First operand 3584 states and 5574 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:53,597 INFO L93 Difference]: Finished difference Result 12653 states and 19964 transitions. [2024-11-20 00:07:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:07:53,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:53,623 INFO L225 Difference]: With dead ends: 12653 [2024-11-20 00:07:53,623 INFO L226 Difference]: Without dead ends: 9091 [2024-11-20 00:07:53,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:07:53,632 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1720 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:53,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2801 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 00:07:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2024-11-20 00:07:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 6740. [2024-11-20 00:07:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6240 states have (on average 1.54375) internal successors, (9633), 6258 states have internal predecessors, (9633), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-20 00:07:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 10490 transitions. [2024-11-20 00:07:53,998 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 10490 transitions. Word has length 190 [2024-11-20 00:07:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 6740 states and 10490 transitions. [2024-11-20 00:07:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 10490 transitions. [2024-11-20 00:07:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:54,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:54,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:54,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:07:54,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:54,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash 224234316, now seen corresponding path program 1 times [2024-11-20 00:07:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:54,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115630962] [2024-11-20 00:07:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:54,208 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:07:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115630962] [2024-11-20 00:07:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115630962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13289679] [2024-11-20 00:07:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:54,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:54,211 INFO L87 Difference]: Start difference. First operand 6740 states and 10490 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:07:56,204 INFO L93 Difference]: Finished difference Result 15913 states and 25157 transitions. [2024-11-20 00:07:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:07:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:07:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:07:56,227 INFO L225 Difference]: With dead ends: 15913 [2024-11-20 00:07:56,227 INFO L226 Difference]: Without dead ends: 9195 [2024-11-20 00:07:56,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:07:56,241 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1421 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:07:56,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 1185 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:07:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9195 states. [2024-11-20 00:07:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9195 to 6740. [2024-11-20 00:07:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6240 states have (on average 1.541025641025641) internal successors, (9616), 6258 states have internal predecessors, (9616), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-20 00:07:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 10473 transitions. [2024-11-20 00:07:56,681 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 10473 transitions. Word has length 190 [2024-11-20 00:07:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:07:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 6740 states and 10473 transitions. [2024-11-20 00:07:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:07:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 10473 transitions. [2024-11-20 00:07:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:07:56,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:07:56,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:07:56,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:07:56,691 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:07:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:07:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1970994550, now seen corresponding path program 1 times [2024-11-20 00:07:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:07:56,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801978828] [2024-11-20 00:07:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:07:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:07:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:07:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:07:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:07:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:07:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:07:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:07:56,956 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:07:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:07:56,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801978828] [2024-11-20 00:07:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801978828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:07:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:07:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:07:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867309273] [2024-11-20 00:07:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:07:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:07:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:07:56,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:07:56,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:07:56,958 INFO L87 Difference]: Start difference. First operand 6740 states and 10473 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:01,316 INFO L93 Difference]: Finished difference Result 24129 states and 37994 transitions. [2024-11-20 00:08:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:01,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:01,368 INFO L225 Difference]: With dead ends: 24129 [2024-11-20 00:08:01,368 INFO L226 Difference]: Without dead ends: 17411 [2024-11-20 00:08:01,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:01,388 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1712 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3730 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:01,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 2801 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3730 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 00:08:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2024-11-20 00:08:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 13082. [2024-11-20 00:08:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13082 states, 12118 states have (on average 1.5382076250206305) internal successors, (18640), 12152 states have internal predecessors, (18640), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-20 00:08:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 20379 transitions. [2024-11-20 00:08:02,187 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 20379 transitions. Word has length 190 [2024-11-20 00:08:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 13082 states and 20379 transitions. [2024-11-20 00:08:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 20379 transitions. [2024-11-20 00:08:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:02,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:02,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:08:02,194 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1626166388, now seen corresponding path program 1 times [2024-11-20 00:08:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126914906] [2024-11-20 00:08:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:02,371 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:08:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126914906] [2024-11-20 00:08:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126914906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:02,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:02,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081486243] [2024-11-20 00:08:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:02,373 INFO L87 Difference]: Start difference. First operand 13082 states and 20379 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:04,739 INFO L93 Difference]: Finished difference Result 30705 states and 48576 transitions. [2024-11-20 00:08:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:08:04,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:04,783 INFO L225 Difference]: With dead ends: 30705 [2024-11-20 00:08:04,783 INFO L226 Difference]: Without dead ends: 17645 [2024-11-20 00:08:04,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:08:04,805 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1420 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1185 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:08:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17645 states. [2024-11-20 00:08:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17645 to 13082. [2024-11-20 00:08:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13082 states, 12118 states have (on average 1.5354844033668922) internal successors, (18607), 12152 states have internal predecessors, (18607), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-20 00:08:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 20346 transitions. [2024-11-20 00:08:05,878 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 20346 transitions. Word has length 190 [2024-11-20 00:08:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 13082 states and 20346 transitions. [2024-11-20 00:08:05,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 20346 transitions. [2024-11-20 00:08:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:05,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:05,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:05,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:08:05,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -645211574, now seen corresponding path program 1 times [2024-11-20 00:08:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932477540] [2024-11-20 00:08:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:06,129 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:08:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:06,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932477540] [2024-11-20 00:08:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932477540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464269047] [2024-11-20 00:08:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:06,131 INFO L87 Difference]: Start difference. First operand 13082 states and 20346 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:11,195 INFO L93 Difference]: Finished difference Result 47083 states and 74158 transitions. [2024-11-20 00:08:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:11,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:11,271 INFO L225 Difference]: With dead ends: 47083 [2024-11-20 00:08:11,272 INFO L226 Difference]: Without dead ends: 34023 [2024-11-20 00:08:11,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:11,300 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1710 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:11,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2801 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 00:08:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34023 states. [2024-11-20 00:08:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34023 to 25828. [2024-11-20 00:08:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25828 states, 23936 states have (on average 1.5332135695187166) internal successors, (36699), 24002 states have internal predecessors, (36699), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-20 00:08:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 40364 transitions. [2024-11-20 00:08:13,246 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 40364 transitions. Word has length 190 [2024-11-20 00:08:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 25828 states and 40364 transitions. [2024-11-20 00:08:13,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 40364 transitions. [2024-11-20 00:08:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:13,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:13,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:13,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:08:13,262 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:13,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1880284108, now seen corresponding path program 1 times [2024-11-20 00:08:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:13,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10792000] [2024-11-20 00:08:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:13,513 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:08:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10792000] [2024-11-20 00:08:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10792000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795497083] [2024-11-20 00:08:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:13,516 INFO L87 Difference]: Start difference. First operand 25828 states and 40364 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:17,480 INFO L93 Difference]: Finished difference Result 60223 states and 95611 transitions. [2024-11-20 00:08:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:08:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:17,568 INFO L225 Difference]: With dead ends: 60223 [2024-11-20 00:08:17,569 INFO L226 Difference]: Without dead ends: 34417 [2024-11-20 00:08:17,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:08:17,612 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1302 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:17,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1410 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:08:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34417 states. [2024-11-20 00:08:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34417 to 25828. [2024-11-20 00:08:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25828 states, 23936 states have (on average 1.5304979946524064) internal successors, (36634), 24002 states have internal predecessors, (36634), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-20 00:08:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 40299 transitions. [2024-11-20 00:08:19,826 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 40299 transitions. Word has length 190 [2024-11-20 00:08:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:19,827 INFO L471 AbstractCegarLoop]: Abstraction has 25828 states and 40299 transitions. [2024-11-20 00:08:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 40299 transitions. [2024-11-20 00:08:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:19,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:19,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:19,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:08:19,839 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 475092430, now seen corresponding path program 1 times [2024-11-20 00:08:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783543538] [2024-11-20 00:08:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,054 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:08:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783543538] [2024-11-20 00:08:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783543538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:20,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638351827] [2024-11-20 00:08:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:20,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:20,056 INFO L87 Difference]: Start difference. First operand 25828 states and 40299 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:23,647 INFO L93 Difference]: Finished difference Result 60157 states and 95284 transitions. [2024-11-20 00:08:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:08:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:23,738 INFO L225 Difference]: With dead ends: 60157 [2024-11-20 00:08:23,738 INFO L226 Difference]: Without dead ends: 34351 [2024-11-20 00:08:23,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:08:23,782 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1240 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:23,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1409 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:08:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34351 states. [2024-11-20 00:08:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34351 to 25828. [2024-11-20 00:08:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25828 states, 23936 states have (on average 1.5277824197860963) internal successors, (36569), 24002 states have internal predecessors, (36569), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-20 00:08:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 40234 transitions. [2024-11-20 00:08:25,739 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 40234 transitions. Word has length 190 [2024-11-20 00:08:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 25828 states and 40234 transitions. [2024-11-20 00:08:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 40234 transitions. [2024-11-20 00:08:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:25,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:25,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:08:25,753 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1925540980, now seen corresponding path program 1 times [2024-11-20 00:08:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939896351] [2024-11-20 00:08:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,066 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:08:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939896351] [2024-11-20 00:08:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939896351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598905781] [2024-11-20 00:08:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:26,070 INFO L87 Difference]: Start difference. First operand 25828 states and 40234 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:34,668 INFO L93 Difference]: Finished difference Result 104317 states and 164044 transitions. [2024-11-20 00:08:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:08:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:08:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:35,038 INFO L225 Difference]: With dead ends: 104317 [2024-11-20 00:08:35,039 INFO L226 Difference]: Without dead ends: 78511 [2024-11-20 00:08:35,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:08:35,085 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 1813 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 4471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:35,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 2787 Invalid, 4471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4400 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-20 00:08:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78511 states. [2024-11-20 00:08:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78511 to 50872. [2024-11-20 00:08:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50872 states, 47188 states have (on average 1.5248156310926506) internal successors, (71953), 47318 states have internal predecessors, (71953), 2781 states have call successors, (2781), 775 states have call predecessors, (2781), 902 states have return successors, (5094), 2906 states have call predecessors, (5094), 2779 states have call successors, (5094) [2024-11-20 00:08:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50872 states to 50872 states and 79828 transitions. [2024-11-20 00:08:39,376 INFO L78 Accepts]: Start accepts. Automaton has 50872 states and 79828 transitions. Word has length 190 [2024-11-20 00:08:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:39,377 INFO L471 AbstractCegarLoop]: Abstraction has 50872 states and 79828 transitions. [2024-11-20 00:08:39,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:08:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50872 states and 79828 transitions. [2024-11-20 00:08:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:08:39,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:39,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:39,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 00:08:39,393 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash -478960114, now seen corresponding path program 1 times [2024-11-20 00:08:39,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327369447] [2024-11-20 00:08:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:08:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:08:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:08:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:08:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,601 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:08:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:39,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327369447] [2024-11-20 00:08:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327369447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:39,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:39,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993984898] [2024-11-20 00:08:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:39,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:39,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:39,603 INFO L87 Difference]: Start difference. First operand 50872 states and 79828 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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)