./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.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:40:33,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:40:33,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:40:33,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:40:33,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:40:34,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:40:34,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:40:34,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:40:34,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:40:34,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:40:34,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:40:34,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:40:34,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:40:34,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:40:34,006 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:40:34,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:40:34,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:40:34,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:40:34,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:40:34,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:40:34,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:40:34,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:40:34,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:40:34,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:40:34,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:40:34,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:40:34,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:40:34,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:40:34,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:40:34,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:40:34,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:40:34,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:40:34,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:40:34,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:40:34,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:40:34,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:40:34,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:40:34,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:40:34,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:40:34,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:40:34,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:40:34,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:40:34,019 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2024-10-12 21:40:34,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:40:34,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:40:34,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:40:34,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:40:34,281 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:40:34,282 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.01.cil-1.c [2024-10-12 21:40:35,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:40:35,908 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:40:35,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-10-12 21:40:35,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c5cd2a0/af3fa07a36e540509a341b3ce24e00d9/FLAGe3c725c52 [2024-10-12 21:40:35,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c5cd2a0/af3fa07a36e540509a341b3ce24e00d9 [2024-10-12 21:40:35,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:40:35,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:40:35,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:40:35,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:40:35,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:40:35,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:40:35" (1/1) ... [2024-10-12 21:40:35,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441a8a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:35, skipping insertion in model container [2024-10-12 21:40:35,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:40:35" (1/1) ... [2024-10-12 21:40:35,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:40:36,159 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2024-10-12 21:40:36,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2024-10-12 21:40:36,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:40:36,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:40:36,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2024-10-12 21:40:36,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2024-10-12 21:40:36,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:40:36,363 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:40:36,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36 WrapperNode [2024-10-12 21:40:36,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:40:36,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:40:36,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:40:36,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:40:36,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,411 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 423 [2024-10-12 21:40:36,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:40:36,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:40:36,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:40:36,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:40:36,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:40:36,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:40:36,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:40:36,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:40:36,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:40:36,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (1/1) ... [2024-10-12 21:40:36,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:40:36,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:36,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:40:36,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:40:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:40:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:40:36,556 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:40:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:40:36,558 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:40:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:40:36,559 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:40:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:40:36,559 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:40:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:40:36,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:40:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:40:36,560 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:40:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:40:36,560 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:40:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:40:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:40:36,560 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:40:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:40:36,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:40:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:40:36,561 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:40:36,669 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:40:36,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:40:37,121 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-12 21:40:37,121 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:40:37,181 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:40:37,181 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-12 21:40:37,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:40:37 BoogieIcfgContainer [2024-10-12 21:40:37,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:40:37,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:40:37,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:40:37,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:40:37,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:40:35" (1/3) ... [2024-10-12 21:40:37,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b021265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:40:37, skipping insertion in model container [2024-10-12 21:40:37,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:40:36" (2/3) ... [2024-10-12 21:40:37,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b021265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:40:37, skipping insertion in model container [2024-10-12 21:40:37,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:40:37" (3/3) ... [2024-10-12 21:40:37,194 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-10-12 21:40:37,208 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:40:37,208 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:40:37,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:40:37,271 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;@15f82c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:40:37,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:40:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-12 21:40:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:40:37,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:37,287 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] [2024-10-12 21:40:37,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:37,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1528274659, now seen corresponding path program 1 times [2024-10-12 21:40:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407734316] [2024-10-12 21:40:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:37,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407734316] [2024-10-12 21:40:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407734316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:37,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:37,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266522167] [2024-10-12 21:40:37,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:37,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:37,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:37,589 INFO L87 Difference]: Start difference. First operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-10-12 21:40:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:37,999 INFO L93 Difference]: Finished difference Result 368 states and 578 transitions. [2024-10-12 21:40:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:38,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 37 [2024-10-12 21:40:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:38,018 INFO L225 Difference]: With dead ends: 368 [2024-10-12 21:40:38,019 INFO L226 Difference]: Without dead ends: 216 [2024-10-12 21:40:38,024 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-10-12 21:40:38,027 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 259 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:38,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 335 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:40:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-12 21:40:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2024-10-12 21:40:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 176 states have internal predecessors, (251), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2024-10-12 21:40:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 305 transitions. [2024-10-12 21:40:38,087 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 305 transitions. Word has length 37 [2024-10-12 21:40:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:38,088 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 305 transitions. [2024-10-12 21:40:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-10-12 21:40:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 305 transitions. [2024-10-12 21:40:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:40:38,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:38,092 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] [2024-10-12 21:40:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:40:38,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1110502537, now seen corresponding path program 1 times [2024-10-12 21:40:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62366381] [2024-10-12 21:40:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:40:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62366381] [2024-10-12 21:40:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62366381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399282375] [2024-10-12 21:40:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:38,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:38,224 INFO L87 Difference]: Start difference. First operand 210 states and 305 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-12 21:40:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:38,509 INFO L93 Difference]: Finished difference Result 444 states and 649 transitions. [2024-10-12 21:40:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:38,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 38 [2024-10-12 21:40:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:38,513 INFO L225 Difference]: With dead ends: 444 [2024-10-12 21:40:38,517 INFO L226 Difference]: Without dead ends: 333 [2024-10-12 21:40:38,518 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-10-12 21:40:38,519 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 272 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:38,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 323 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-12 21:40:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 310. [2024-10-12 21:40:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 259 states have (on average 1.4247104247104247) internal successors, (369), 264 states have internal predecessors, (369), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (43), 31 states have call predecessors, (43), 31 states have call successors, (43) [2024-10-12 21:40:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 445 transitions. [2024-10-12 21:40:38,568 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 445 transitions. Word has length 38 [2024-10-12 21:40:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:38,569 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 445 transitions. [2024-10-12 21:40:38,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-12 21:40:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 445 transitions. [2024-10-12 21:40:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:40:38,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:38,576 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] [2024-10-12 21:40:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:40:38,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:38,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1727996056, now seen corresponding path program 1 times [2024-10-12 21:40:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:38,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763475335] [2024-10-12 21:40:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:40:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763475335] [2024-10-12 21:40:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763475335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116944732] [2024-10-12 21:40:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:38,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:38,654 INFO L87 Difference]: Start difference. First operand 310 states and 445 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-12 21:40:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:38,963 INFO L93 Difference]: Finished difference Result 730 states and 1026 transitions. [2024-10-12 21:40:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:38,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 39 [2024-10-12 21:40:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:38,971 INFO L225 Difference]: With dead ends: 730 [2024-10-12 21:40:38,971 INFO L226 Difference]: Without dead ends: 519 [2024-10-12 21:40:38,973 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-10-12 21:40:38,974 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 137 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:38,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 426 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-12 21:40:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 415. [2024-10-12 21:40:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.4147727272727273) internal successors, (498), 359 states have internal predecessors, (498), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2024-10-12 21:40:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 586 transitions. [2024-10-12 21:40:39,023 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 586 transitions. Word has length 39 [2024-10-12 21:40:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:39,025 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 586 transitions. [2024-10-12 21:40:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-12 21:40:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 586 transitions. [2024-10-12 21:40:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:39,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:39,032 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] [2024-10-12 21:40:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:40:39,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1833980046, now seen corresponding path program 1 times [2024-10-12 21:40:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522572456] [2024-10-12 21:40:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522572456] [2024-10-12 21:40:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522572456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:39,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:39,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:40:39,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062212630] [2024-10-12 21:40:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:39,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:40:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:40:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:39,145 INFO L87 Difference]: Start difference. First operand 415 states and 586 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:39,528 INFO L93 Difference]: Finished difference Result 524 states and 750 transitions. [2024-10-12 21:40:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:40:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:39,531 INFO L225 Difference]: With dead ends: 524 [2024-10-12 21:40:39,531 INFO L226 Difference]: Without dead ends: 435 [2024-10-12 21:40:39,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:40:39,533 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 248 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:39,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 367 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:40:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-12 21:40:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 415. [2024-10-12 21:40:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.4119318181818181) internal successors, (497), 359 states have internal predecessors, (497), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2024-10-12 21:40:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2024-10-12 21:40:39,567 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 51 [2024-10-12 21:40:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:39,567 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2024-10-12 21:40:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2024-10-12 21:40:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:39,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:39,581 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] [2024-10-12 21:40:39,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:40:39,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 940493708, now seen corresponding path program 1 times [2024-10-12 21:40:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:39,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612118235] [2024-10-12 21:40:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:39,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612118235] [2024-10-12 21:40:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612118235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:40:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616887523] [2024-10-12 21:40:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:40:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:40:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:39,755 INFO L87 Difference]: Start difference. First operand 415 states and 585 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:40,385 INFO L93 Difference]: Finished difference Result 624 states and 897 transitions. [2024-10-12 21:40:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:40:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:40,390 INFO L225 Difference]: With dead ends: 624 [2024-10-12 21:40:40,394 INFO L226 Difference]: Without dead ends: 538 [2024-10-12 21:40:40,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:40:40,396 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 411 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:40,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 489 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:40:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-12 21:40:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 499. [2024-10-12 21:40:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 419 states have (on average 1.422434367541766) internal successors, (596), 427 states have internal predecessors, (596), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2024-10-12 21:40:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 707 transitions. [2024-10-12 21:40:40,443 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 707 transitions. Word has length 51 [2024-10-12 21:40:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:40,444 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 707 transitions. [2024-10-12 21:40:40,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 707 transitions. [2024-10-12 21:40:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:40,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:40,448 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] [2024-10-12 21:40:40,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:40:40,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:40,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1786842256, now seen corresponding path program 1 times [2024-10-12 21:40:40,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:40,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419160362] [2024-10-12 21:40:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:40,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419160362] [2024-10-12 21:40:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419160362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:40:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137889658] [2024-10-12 21:40:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:40,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:40:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:40:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:40,622 INFO L87 Difference]: Start difference. First operand 499 states and 707 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:41,424 INFO L93 Difference]: Finished difference Result 809 states and 1159 transitions. [2024-10-12 21:40:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:40:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:41,429 INFO L225 Difference]: With dead ends: 809 [2024-10-12 21:40:41,429 INFO L226 Difference]: Without dead ends: 639 [2024-10-12 21:40:41,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:40:41,432 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 412 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:41,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 742 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:40:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-12 21:40:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 578. [2024-10-12 21:40:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 481 states have (on average 1.4241164241164241) internal successors, (685), 490 states have internal predecessors, (685), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2024-10-12 21:40:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 818 transitions. [2024-10-12 21:40:41,503 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 818 transitions. Word has length 51 [2024-10-12 21:40:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:41,503 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 818 transitions. [2024-10-12 21:40:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 818 transitions. [2024-10-12 21:40:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:41,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:41,505 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] [2024-10-12 21:40:41,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:40:41,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:41,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash 415034958, now seen corresponding path program 1 times [2024-10-12 21:40:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:41,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664804286] [2024-10-12 21:40:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:41,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664804286] [2024-10-12 21:40:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664804286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:41,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:40:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111646637] [2024-10-12 21:40:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:40:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:40:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:41,617 INFO L87 Difference]: Start difference. First operand 578 states and 818 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:42,431 INFO L93 Difference]: Finished difference Result 1096 states and 1568 transitions. [2024-10-12 21:40:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:40:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:42,436 INFO L225 Difference]: With dead ends: 1096 [2024-10-12 21:40:42,437 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 21:40:42,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:40:42,438 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 416 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:42,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 729 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:40:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 21:40:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 726. [2024-10-12 21:40:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 597 states have (on average 1.4271356783919598) internal successors, (852), 608 states have internal predecessors, (852), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2024-10-12 21:40:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1029 transitions. [2024-10-12 21:40:42,495 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1029 transitions. Word has length 51 [2024-10-12 21:40:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:42,495 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1029 transitions. [2024-10-12 21:40:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1029 transitions. [2024-10-12 21:40:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:42,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:42,497 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] [2024-10-12 21:40:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:40:42,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -614324340, now seen corresponding path program 1 times [2024-10-12 21:40:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348832960] [2024-10-12 21:40:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:42,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348832960] [2024-10-12 21:40:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348832960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:42,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:40:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681916891] [2024-10-12 21:40:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:42,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:40:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:40:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:42,595 INFO L87 Difference]: Start difference. First operand 726 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:43,068 INFO L93 Difference]: Finished difference Result 1205 states and 1739 transitions. [2024-10-12 21:40:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:40:43,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:43,074 INFO L225 Difference]: With dead ends: 1205 [2024-10-12 21:40:43,074 INFO L226 Difference]: Without dead ends: 809 [2024-10-12 21:40:43,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:40:43,076 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 153 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:43,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 550 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:40:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-10-12 21:40:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 736. [2024-10-12 21:40:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 607 states have (on average 1.4200988467874793) internal successors, (862), 618 states have internal predecessors, (862), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2024-10-12 21:40:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1039 transitions. [2024-10-12 21:40:43,152 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1039 transitions. Word has length 51 [2024-10-12 21:40:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:43,152 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1039 transitions. [2024-10-12 21:40:43,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1039 transitions. [2024-10-12 21:40:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:40:43,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:43,154 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] [2024-10-12 21:40:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:40:43,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:43,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash -591692086, now seen corresponding path program 1 times [2024-10-12 21:40:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385014043] [2024-10-12 21:40:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385014043] [2024-10-12 21:40:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385014043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:40:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286221463] [2024-10-12 21:40:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:43,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:40:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:40:43,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:43,258 INFO L87 Difference]: Start difference. First operand 736 states and 1039 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:44,343 INFO L93 Difference]: Finished difference Result 2121 states and 3112 transitions. [2024-10-12 21:40:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:40:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-12 21:40:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:44,354 INFO L225 Difference]: With dead ends: 2121 [2024-10-12 21:40:44,354 INFO L226 Difference]: Without dead ends: 1715 [2024-10-12 21:40:44,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:40:44,359 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 916 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:44,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 591 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:40:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-12 21:40:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1527. [2024-10-12 21:40:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1225 states have (on average 1.409795918367347) internal successors, (1727), 1253 states have internal predecessors, (1727), 178 states have call successors, (178), 109 states have call predecessors, (178), 122 states have return successors, (255), 168 states have call predecessors, (255), 176 states have call successors, (255) [2024-10-12 21:40:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2160 transitions. [2024-10-12 21:40:44,506 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2160 transitions. Word has length 51 [2024-10-12 21:40:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:44,507 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 2160 transitions. [2024-10-12 21:40:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:40:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2160 transitions. [2024-10-12 21:40:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:40:44,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:44,508 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] [2024-10-12 21:40:44,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:40:44,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1488931652, now seen corresponding path program 1 times [2024-10-12 21:40:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:44,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794225249] [2024-10-12 21:40:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:40:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:40:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:40:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794225249] [2024-10-12 21:40:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794225249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747007071] [2024-10-12 21:40:44,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:44,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:44,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:44,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:44,594 INFO L87 Difference]: Start difference. First operand 1527 states and 2160 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-10-12 21:40:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:44,928 INFO L93 Difference]: Finished difference Result 2043 states and 2877 transitions. [2024-10-12 21:40:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:44,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 54 [2024-10-12 21:40:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:44,937 INFO L225 Difference]: With dead ends: 2043 [2024-10-12 21:40:44,937 INFO L226 Difference]: Without dead ends: 1727 [2024-10-12 21:40:44,939 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-10-12 21:40:44,939 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 122 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:44,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-12 21:40:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1693. [2024-10-12 21:40:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1367 states have (on average 1.3920994879297732) internal successors, (1903), 1397 states have internal predecessors, (1903), 192 states have call successors, (192), 117 states have call predecessors, (192), 132 states have return successors, (279), 182 states have call predecessors, (279), 190 states have call successors, (279) [2024-10-12 21:40:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2374 transitions. [2024-10-12 21:40:45,093 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2374 transitions. Word has length 54 [2024-10-12 21:40:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:45,093 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2374 transitions. [2024-10-12 21:40:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-10-12 21:40:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2374 transitions. [2024-10-12 21:40:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:40:45,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:45,097 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:40:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:40:45,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1336073208, now seen corresponding path program 1 times [2024-10-12 21:40:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489814017] [2024-10-12 21:40:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:40:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:40:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:40:45,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:45,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489814017] [2024-10-12 21:40:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489814017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:45,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:45,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302616677] [2024-10-12 21:40:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:45,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:45,155 INFO L87 Difference]: Start difference. First operand 1693 states and 2374 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-12 21:40:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:45,470 INFO L93 Difference]: Finished difference Result 2272 states and 3153 transitions. [2024-10-12 21:40:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 59 [2024-10-12 21:40:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:45,481 INFO L225 Difference]: With dead ends: 2272 [2024-10-12 21:40:45,481 INFO L226 Difference]: Without dead ends: 1870 [2024-10-12 21:40:45,483 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-10-12 21:40:45,484 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 257 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:45,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 333 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-12 21:40:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1821. [2024-10-12 21:40:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1479 states have (on average 1.3779580797836375) internal successors, (2038), 1511 states have internal predecessors, (2038), 200 states have call successors, (200), 123 states have call predecessors, (200), 140 states have return successors, (293), 190 states have call predecessors, (293), 198 states have call successors, (293) [2024-10-12 21:40:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2531 transitions. [2024-10-12 21:40:45,653 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2531 transitions. Word has length 59 [2024-10-12 21:40:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:45,654 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2531 transitions. [2024-10-12 21:40:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-12 21:40:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2531 transitions. [2024-10-12 21:40:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:40:45,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:45,656 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 21:40:45,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:40:45,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1066089968, now seen corresponding path program 1 times [2024-10-12 21:40:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427484327] [2024-10-12 21:40:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:40:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:40:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427484327] [2024-10-12 21:40:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427484327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762707474] [2024-10-12 21:40:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:45,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:45,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:40:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:45,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:40:45,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:40:45,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762707474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:40:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300923902] [2024-10-12 21:40:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:45,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:45,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:45,867 INFO L87 Difference]: Start difference. First operand 1821 states and 2531 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:40:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:46,062 INFO L93 Difference]: Finished difference Result 2309 states and 3205 transitions. [2024-10-12 21:40:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:40:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 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 60 [2024-10-12 21:40:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:46,072 INFO L225 Difference]: With dead ends: 2309 [2024-10-12 21:40:46,072 INFO L226 Difference]: Without dead ends: 1826 [2024-10-12 21:40:46,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:46,074 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:46,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-10-12 21:40:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1826. [2024-10-12 21:40:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1484 states have (on average 1.3712938005390836) internal successors, (2035), 1516 states have internal predecessors, (2035), 200 states have call successors, (200), 123 states have call predecessors, (200), 140 states have return successors, (293), 190 states have call predecessors, (293), 198 states have call successors, (293) [2024-10-12 21:40:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2528 transitions. [2024-10-12 21:40:46,249 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2528 transitions. Word has length 60 [2024-10-12 21:40:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:46,250 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2528 transitions. [2024-10-12 21:40:46,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:40:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2528 transitions. [2024-10-12 21:40:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:40:46,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:46,252 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:40:46,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:40:46,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 21:40:46,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1910095470, now seen corresponding path program 1 times [2024-10-12 21:40:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537074171] [2024-10-12 21:40:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:40:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:40:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537074171] [2024-10-12 21:40:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537074171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75670065] [2024-10-12 21:40:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:46,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:46,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:40:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:46,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:40:46,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:40:46,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75670065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:40:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124157708] [2024-10-12 21:40:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:46,634 INFO L87 Difference]: Start difference. First operand 1826 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:40:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:46,797 INFO L93 Difference]: Finished difference Result 2252 states and 3107 transitions. [2024-10-12 21:40:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:40:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 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 60 [2024-10-12 21:40:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:46,807 INFO L225 Difference]: With dead ends: 2252 [2024-10-12 21:40:46,807 INFO L226 Difference]: Without dead ends: 1723 [2024-10-12 21:40:46,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:46,810 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:46,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-10-12 21:40:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1716. [2024-10-12 21:40:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1392 states have (on average 1.3735632183908046) internal successors, (1912), 1422 states have internal predecessors, (1912), 190 states have call successors, (190), 117 states have call predecessors, (190), 132 states have return successors, (274), 180 states have call predecessors, (274), 188 states have call successors, (274) [2024-10-12 21:40:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2376 transitions. [2024-10-12 21:40:46,988 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2376 transitions. Word has length 60 [2024-10-12 21:40:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2376 transitions. [2024-10-12 21:40:46,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:40:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2376 transitions. [2024-10-12 21:40:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:40:46,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:46,990 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:40:47,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:40:47,191 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,SelfDestructingSolverStorable12 [2024-10-12 21:40:47,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:47,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -112455854, now seen corresponding path program 1 times [2024-10-12 21:40:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730826847] [2024-10-12 21:40:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:40:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:40:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730826847] [2024-10-12 21:40:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730826847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:40:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575929188] [2024-10-12 21:40:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:40:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:40:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:40:47,265 INFO L87 Difference]: Start difference. First operand 1716 states and 2376 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 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-10-12 21:40:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:47,620 INFO L93 Difference]: Finished difference Result 1801 states and 2479 transitions. [2024-10-12 21:40:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:40:47,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 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 60 [2024-10-12 21:40:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:47,629 INFO L225 Difference]: With dead ends: 1801 [2024-10-12 21:40:47,629 INFO L226 Difference]: Without dead ends: 1798 [2024-10-12 21:40:47,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:40:47,630 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 456 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:47,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 330 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-10-12 21:40:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1715. [2024-10-12 21:40:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1392 states have (on average 1.3721264367816093) internal successors, (1910), 1421 states have internal predecessors, (1910), 189 states have call successors, (189), 117 states have call predecessors, (189), 132 states have return successors, (274), 180 states have call predecessors, (274), 188 states have call successors, (274) [2024-10-12 21:40:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2373 transitions. [2024-10-12 21:40:47,763 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2373 transitions. Word has length 60 [2024-10-12 21:40:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:47,764 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2373 transitions. [2024-10-12 21:40:47,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 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-10-12 21:40:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2373 transitions. [2024-10-12 21:40:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:40:47,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:47,766 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:40:47,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:40:47,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:47,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 808247865, now seen corresponding path program 1 times [2024-10-12 21:40:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890801724] [2024-10-12 21:40:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:47,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:40:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:40:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890801724] [2024-10-12 21:40:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890801724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463664738] [2024-10-12 21:40:47,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:47,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:47,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:47,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:40:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:47,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:40:47,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:40:48,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:40:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:40:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463664738] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:40:48,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:40:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:40:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405415955] [2024-10-12 21:40:48,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:40:48,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:40:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:40:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:40:48,274 INFO L87 Difference]: Start difference. First operand 1715 states and 2373 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:40:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:48,861 INFO L93 Difference]: Finished difference Result 2518 states and 3408 transitions. [2024-10-12 21:40:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:40:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-12 21:40:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:48,888 INFO L225 Difference]: With dead ends: 2518 [2024-10-12 21:40:48,888 INFO L226 Difference]: Without dead ends: 2515 [2024-10-12 21:40:48,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:40:48,890 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 578 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:48,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 865 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:40:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2024-10-12 21:40:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2018. [2024-10-12 21:40:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1659 states have (on average 1.3598553345388789) internal successors, (2256), 1694 states have internal predecessors, (2256), 208 states have call successors, (208), 130 states have call predecessors, (208), 149 states have return successors, (304), 197 states have call predecessors, (304), 207 states have call successors, (304) [2024-10-12 21:40:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2768 transitions. [2024-10-12 21:40:49,053 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2768 transitions. Word has length 61 [2024-10-12 21:40:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 2768 transitions. [2024-10-12 21:40:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:40:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2768 transitions. [2024-10-12 21:40:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:40:49,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:49,057 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:40:49,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:40:49,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:49,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash 490403576, now seen corresponding path program 2 times [2024-10-12 21:40:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024331939] [2024-10-12 21:40:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:40:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:40:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 21:40:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024331939] [2024-10-12 21:40:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024331939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:40:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656542107] [2024-10-12 21:40:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:40:49,305 INFO L87 Difference]: Start difference. First operand 2018 states and 2768 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:40:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:49,696 INFO L93 Difference]: Finished difference Result 2646 states and 3585 transitions. [2024-10-12 21:40:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:40:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-12 21:40:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:49,707 INFO L225 Difference]: With dead ends: 2646 [2024-10-12 21:40:49,707 INFO L226 Difference]: Without dead ends: 1987 [2024-10-12 21:40:49,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-12 21:40:49,709 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 270 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:49,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 349 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2024-10-12 21:40:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1910. [2024-10-12 21:40:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1564 states have (on average 1.360613810741688) internal successors, (2128), 1599 states have internal predecessors, (2128), 201 states have call successors, (201), 125 states have call predecessors, (201), 143 states have return successors, (293), 189 states have call predecessors, (293), 200 states have call successors, (293) [2024-10-12 21:40:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2622 transitions. [2024-10-12 21:40:49,903 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2622 transitions. Word has length 78 [2024-10-12 21:40:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2622 transitions. [2024-10-12 21:40:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:40:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2622 transitions. [2024-10-12 21:40:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 21:40:49,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:49,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:40:49,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1358284113, now seen corresponding path program 1 times [2024-10-12 21:40:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768383428] [2024-10-12 21:40:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:40:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 21:40:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 21:40:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768383428] [2024-10-12 21:40:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768383428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713318870] [2024-10-12 21:40:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:49,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:40:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:40:50,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:40:50,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713318870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 21:40:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051925287] [2024-10-12 21:40:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:50,095 INFO L87 Difference]: Start difference. First operand 1910 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:50,333 INFO L93 Difference]: Finished difference Result 3259 states and 4597 transitions. [2024-10-12 21:40:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-10-12 21:40:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:50,344 INFO L225 Difference]: With dead ends: 3259 [2024-10-12 21:40:50,345 INFO L226 Difference]: Without dead ends: 2139 [2024-10-12 21:40:50,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:50,350 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 98 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:50,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 483 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-12 21:40:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-12 21:40:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1745 states have (on average 1.3644699140401146) internal successors, (2381), 1782 states have internal predecessors, (2381), 229 states have call successors, (229), 143 states have call predecessors, (229), 163 states have return successors, (335), 217 states have call predecessors, (335), 228 states have call successors, (335) [2024-10-12 21:40:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2945 transitions. [2024-10-12 21:40:50,552 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2945 transitions. Word has length 83 [2024-10-12 21:40:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:50,552 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2945 transitions. [2024-10-12 21:40:50,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2945 transitions. [2024-10-12 21:40:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:40:50,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:50,556 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:50,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:40:50,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 21:40:50,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:50,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash 431778550, now seen corresponding path program 1 times [2024-10-12 21:40:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419829215] [2024-10-12 21:40:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:40:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:40:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:40:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:40:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:40:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:40:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419829215] [2024-10-12 21:40:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419829215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92276002] [2024-10-12 21:40:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:50,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:50,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:50,834 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-10-12 21:40:50,835 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-10-12 21:40:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:50,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:40:50,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:40:50,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92276002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:40:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254790238] [2024-10-12 21:40:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:50,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:50,944 INFO L87 Difference]: Start difference. First operand 2139 states and 2945 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, (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-10-12 21:40:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:51,120 INFO L93 Difference]: Finished difference Result 2422 states and 3301 transitions. [2024-10-12 21:40:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:51,121 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, (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 92 [2024-10-12 21:40:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:51,128 INFO L225 Difference]: With dead ends: 2422 [2024-10-12 21:40:51,128 INFO L226 Difference]: Without dead ends: 1435 [2024-10-12 21:40:51,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:51,131 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 55 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:51,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 414 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-10-12 21:40:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2024-10-12 21:40:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1126 states have (on average 1.4103019538188277) internal successors, (1588), 1150 states have internal predecessors, (1588), 182 states have call successors, (182), 112 states have call predecessors, (182), 126 states have return successors, (263), 176 states have call predecessors, (263), 182 states have call successors, (263) [2024-10-12 21:40:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2033 transitions. [2024-10-12 21:40:51,282 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2033 transitions. Word has length 92 [2024-10-12 21:40:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:51,282 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2033 transitions. [2024-10-12 21:40:51,282 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, (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-10-12 21:40:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2033 transitions. [2024-10-12 21:40:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 21:40:51,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:51,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:51,309 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-10-12 21:40:51,489 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,SelfDestructingSolverStorable17 [2024-10-12 21:40:51,489 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -230887016, now seen corresponding path program 1 times [2024-10-12 21:40:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082565586] [2024-10-12 21:40:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:40:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 21:40:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:40:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 21:40:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:51,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082565586] [2024-10-12 21:40:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082565586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:51,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725510497] [2024-10-12 21:40:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:51,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:51,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:51,596 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:51,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 21:40:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:51,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:40:51,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:40:51,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725510497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:51,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:40:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866453394] [2024-10-12 21:40:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:51,786 INFO L87 Difference]: Start difference. First operand 1435 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 21:40:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:52,038 INFO L93 Difference]: Finished difference Result 3047 states and 4375 transitions. [2024-10-12 21:40:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-10-12 21:40:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:52,049 INFO L225 Difference]: With dead ends: 3047 [2024-10-12 21:40:52,050 INFO L226 Difference]: Without dead ends: 2111 [2024-10-12 21:40:52,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:52,053 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:52,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-10-12 21:40:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2092. [2024-10-12 21:40:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1648 states have (on average 1.4095873786407767) internal successors, (2323), 1681 states have internal predecessors, (2323), 260 states have call successors, (260), 163 states have call predecessors, (260), 183 states have return successors, (367), 251 states have call predecessors, (367), 260 states have call successors, (367) [2024-10-12 21:40:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2950 transitions. [2024-10-12 21:40:52,236 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2950 transitions. Word has length 106 [2024-10-12 21:40:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:52,237 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2950 transitions. [2024-10-12 21:40:52,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 21:40:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2950 transitions. [2024-10-12 21:40:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:40:52,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:52,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:52,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 21:40:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:52,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1947745732, now seen corresponding path program 1 times [2024-10-12 21:40:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649412184] [2024-10-12 21:40:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:40:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 21:40:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 21:40:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:40:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 21:40:52,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649412184] [2024-10-12 21:40:52,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649412184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037821436] [2024-10-12 21:40:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:52,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:52,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:52,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 21:40:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:52,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:40:52,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:40:52,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037821436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 21:40:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249524926] [2024-10-12 21:40:52,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:52,659 INFO L87 Difference]: Start difference. First operand 2092 states and 2950 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 21:40:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:52,831 INFO L93 Difference]: Finished difference Result 4253 states and 6055 transitions. [2024-10-12 21:40:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2024-10-12 21:40:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:52,839 INFO L225 Difference]: With dead ends: 4253 [2024-10-12 21:40:52,840 INFO L226 Difference]: Without dead ends: 2296 [2024-10-12 21:40:52,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:52,845 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:52,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-10-12 21:40:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2210. [2024-10-12 21:40:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1760 states have (on average 1.330681818181818) internal successors, (2342), 1787 states have internal predecessors, (2342), 253 states have call successors, (253), 176 states have call predecessors, (253), 196 states have return successors, (334), 248 states have call predecessors, (334), 253 states have call successors, (334) [2024-10-12 21:40:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2929 transitions. [2024-10-12 21:40:53,067 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2929 transitions. Word has length 121 [2024-10-12 21:40:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:53,070 INFO L471 AbstractCegarLoop]: Abstraction has 2210 states and 2929 transitions. [2024-10-12 21:40:53,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 21:40:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2929 transitions. [2024-10-12 21:40:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:40:53,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:53,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:53,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 21:40:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:53,277 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1991312345, now seen corresponding path program 1 times [2024-10-12 21:40:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827964569] [2024-10-12 21:40:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:40:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 21:40:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 21:40:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:40:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 21:40:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827964569] [2024-10-12 21:40:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827964569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836240361] [2024-10-12 21:40:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:53,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:53,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 21:40:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:53,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 21:40:53,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 21:40:53,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:53,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836240361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:53,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:53,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 21:40:53,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725869449] [2024-10-12 21:40:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:53,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:53,493 INFO L87 Difference]: Start difference. First operand 2210 states and 2929 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 21:40:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:53,698 INFO L93 Difference]: Finished difference Result 4452 states and 5938 transitions. [2024-10-12 21:40:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:53,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 121 [2024-10-12 21:40:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:53,706 INFO L225 Difference]: With dead ends: 4452 [2024-10-12 21:40:53,706 INFO L226 Difference]: Without dead ends: 2252 [2024-10-12 21:40:53,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:53,712 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 112 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:53,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 232 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2024-10-12 21:40:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2189. [2024-10-12 21:40:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1739 states have (on average 1.2984473835537664) internal successors, (2258), 1766 states have internal predecessors, (2258), 253 states have call successors, (253), 176 states have call predecessors, (253), 196 states have return successors, (334), 248 states have call predecessors, (334), 253 states have call successors, (334) [2024-10-12 21:40:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2845 transitions. [2024-10-12 21:40:53,903 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2845 transitions. Word has length 121 [2024-10-12 21:40:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 2189 states and 2845 transitions. [2024-10-12 21:40:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 21:40:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2845 transitions. [2024-10-12 21:40:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:40:53,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:53,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:53,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 21:40:54,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-12 21:40:54,107 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:54,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1687415604, now seen corresponding path program 1 times [2024-10-12 21:40:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6096458] [2024-10-12 21:40:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:40:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 21:40:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:40:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:40:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 21:40:54,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6096458] [2024-10-12 21:40:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6096458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037959869] [2024-10-12 21:40:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:54,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:54,198 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:54,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 21:40:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:54,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:40:54,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:40:54,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037959869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 21:40:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883218707] [2024-10-12 21:40:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:54,344 INFO L87 Difference]: Start difference. First operand 2189 states and 2845 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 21:40:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:54,724 INFO L93 Difference]: Finished difference Result 6381 states and 8375 transitions. [2024-10-12 21:40:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2024-10-12 21:40:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:54,741 INFO L225 Difference]: With dead ends: 6381 [2024-10-12 21:40:54,741 INFO L226 Difference]: Without dead ends: 4202 [2024-10-12 21:40:54,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:54,747 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 99 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:54,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 335 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2024-10-12 21:40:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4200. [2024-10-12 21:40:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 3338 states have (on average 1.2828040742959856) internal successors, (4282), 3392 states have internal predecessors, (4282), 483 states have call successors, (483), 341 states have call predecessors, (483), 378 states have return successors, (729), 470 states have call predecessors, (729), 483 states have call successors, (729) [2024-10-12 21:40:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 5494 transitions. [2024-10-12 21:40:55,075 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 5494 transitions. Word has length 122 [2024-10-12 21:40:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:55,075 INFO L471 AbstractCegarLoop]: Abstraction has 4200 states and 5494 transitions. [2024-10-12 21:40:55,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 21:40:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 5494 transitions. [2024-10-12 21:40:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 21:40:55,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:55,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:55,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 21:40:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:55,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1886775416, now seen corresponding path program 1 times [2024-10-12 21:40:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929455390] [2024-10-12 21:40:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 21:40:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:40:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:40:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 21:40:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 21:40:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929455390] [2024-10-12 21:40:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929455390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555208199] [2024-10-12 21:40:55,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:55,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:55,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:55,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 21:40:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:55,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 21:40:55,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:40:55,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555208199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:55,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 21:40:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258035985] [2024-10-12 21:40:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:55,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:40:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:40:55,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:55,548 INFO L87 Difference]: Start difference. First operand 4200 states and 5494 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 21:40:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:55,855 INFO L93 Difference]: Finished difference Result 6027 states and 8051 transitions. [2024-10-12 21:40:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:40:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-12 21:40:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:55,875 INFO L225 Difference]: With dead ends: 6027 [2024-10-12 21:40:55,875 INFO L226 Difference]: Without dead ends: 3867 [2024-10-12 21:40:55,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:40:55,884 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 72 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:55,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 296 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2024-10-12 21:40:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3824. [2024-10-12 21:40:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3043 states have (on average 1.264212947748932) internal successors, (3847), 3093 states have internal predecessors, (3847), 439 states have call successors, (439), 311 states have call predecessors, (439), 341 states have return successors, (645), 423 states have call predecessors, (645), 439 states have call successors, (645) [2024-10-12 21:40:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4931 transitions. [2024-10-12 21:40:56,210 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4931 transitions. Word has length 123 [2024-10-12 21:40:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:56,211 INFO L471 AbstractCegarLoop]: Abstraction has 3824 states and 4931 transitions. [2024-10-12 21:40:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 21:40:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4931 transitions. [2024-10-12 21:40:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 21:40:56,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:56,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:56,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 21:40:56,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 21:40:56,421 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:56,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -476751664, now seen corresponding path program 1 times [2024-10-12 21:40:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569981662] [2024-10-12 21:40:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 21:40:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:40:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:40:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 21:40:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 21:40:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569981662] [2024-10-12 21:40:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569981662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925790279] [2024-10-12 21:40:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:56,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:56,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:56,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:56,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 21:40:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:56,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 21:40:56,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 21:40:56,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925790279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-12 21:40:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69127490] [2024-10-12 21:40:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:40:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:40:56,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:40:56,675 INFO L87 Difference]: Start difference. First operand 3824 states and 4931 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:57,336 INFO L93 Difference]: Finished difference Result 6194 states and 8091 transitions. [2024-10-12 21:40:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:40:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2024-10-12 21:40:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:57,353 INFO L225 Difference]: With dead ends: 6194 [2024-10-12 21:40:57,353 INFO L226 Difference]: Without dead ends: 3562 [2024-10-12 21:40:57,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:40:57,362 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 128 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:57,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 185 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:40:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2024-10-12 21:40:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2582. [2024-10-12 21:40:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2061 states have (on average 1.2290150412421155) internal successors, (2533), 2089 states have internal predecessors, (2533), 299 states have call successors, (299), 207 states have call predecessors, (299), 221 states have return successors, (425), 287 states have call predecessors, (425), 299 states have call successors, (425) [2024-10-12 21:40:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3257 transitions. [2024-10-12 21:40:57,650 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3257 transitions. Word has length 124 [2024-10-12 21:40:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:57,651 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 3257 transitions. [2024-10-12 21:40:57,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3257 transitions. [2024-10-12 21:40:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 21:40:57,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:57,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:57,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-12 21:40:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 21:40:57,859 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1360260654, now seen corresponding path program 1 times [2024-10-12 21:40:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:57,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844603358] [2024-10-12 21:40:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 21:40:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:40:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:40:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 21:40:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 21:40:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844603358] [2024-10-12 21:40:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844603358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999245175] [2024-10-12 21:40:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:57,947 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:57,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 21:40:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 21:40:58,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 21:40:58,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999245175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:58,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:58,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-12 21:40:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237939857] [2024-10-12 21:40:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:40:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:40:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:40:58,137 INFO L87 Difference]: Start difference. First operand 2582 states and 3257 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:58,480 INFO L93 Difference]: Finished difference Result 4577 states and 5829 transitions. [2024-10-12 21:40:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:40:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2024-10-12 21:40:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:58,489 INFO L225 Difference]: With dead ends: 4577 [2024-10-12 21:40:58,490 INFO L226 Difference]: Without dead ends: 2005 [2024-10-12 21:40:58,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:40:58,497 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 155 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:58,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 179 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:40:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-10-12 21:40:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1985. [2024-10-12 21:40:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1589 states have (on average 1.1529263687853997) internal successors, (1832), 1607 states have internal predecessors, (1832), 223 states have call successors, (223), 158 states have call predecessors, (223), 172 states have return successors, (296), 221 states have call predecessors, (296), 223 states have call successors, (296) [2024-10-12 21:40:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2351 transitions. [2024-10-12 21:40:58,722 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2351 transitions. Word has length 124 [2024-10-12 21:40:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:58,722 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2351 transitions. [2024-10-12 21:40:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2351 transitions. [2024-10-12 21:40:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 21:40:58,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:58,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:58,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-12 21:40:58,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-12 21:40:58,927 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1388760944, now seen corresponding path program 1 times [2024-10-12 21:40:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237617600] [2024-10-12 21:40:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 21:40:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:40:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:40:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 21:40:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 21:40:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237617600] [2024-10-12 21:40:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237617600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:40:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706864338] [2024-10-12 21:40:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:40:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:40:59,009 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:40:59,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 21:40:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:40:59,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:40:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 21:40:59,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:40:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706864338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:40:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-12 21:40:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956440646] [2024-10-12 21:40:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:40:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:40:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:59,107 INFO L87 Difference]: Start difference. First operand 1985 states and 2351 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:59,308 INFO L93 Difference]: Finished difference Result 3128 states and 3728 transitions. [2024-10-12 21:40:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:40:59,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2024-10-12 21:40:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:59,313 INFO L225 Difference]: With dead ends: 3128 [2024-10-12 21:40:59,313 INFO L226 Difference]: Without dead ends: 782 [2024-10-12 21:40:59,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:59,318 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:59,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:40:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-12 21:40:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2024-10-12 21:40:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 625 states have (on average 1.1184) internal successors, (699), 632 states have internal predecessors, (699), 90 states have call successors, (90), 62 states have call predecessors, (90), 66 states have return successors, (101), 88 states have call predecessors, (101), 90 states have call successors, (101) [2024-10-12 21:40:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 890 transitions. [2024-10-12 21:40:59,404 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 890 transitions. Word has length 124 [2024-10-12 21:40:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:59,404 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 890 transitions. [2024-10-12 21:40:59,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 21:40:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 890 transitions. [2024-10-12 21:40:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 21:40:59,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:59,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:59,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-12 21:40:59,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-12 21:40:59,606 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:59,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:59,607 INFO L85 PathProgramCache]: Analyzing trace with hash -805635248, now seen corresponding path program 1 times [2024-10-12 21:40:59,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:59,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127122202] [2024-10-12 21:40:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:40:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:40:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:40:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 21:40:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 21:40:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 21:40:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 21:40:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:40:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:40:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 21:40:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 21:40:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127122202] [2024-10-12 21:40:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127122202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:40:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341290196] [2024-10-12 21:40:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:40:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:40:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:40:59,719 INFO L87 Difference]: Start difference. First operand 782 states and 890 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 21:41:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:00,161 INFO L93 Difference]: Finished difference Result 939 states and 1065 transitions. [2024-10-12 21:41:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:41:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2024-10-12 21:41:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:00,164 INFO L225 Difference]: With dead ends: 939 [2024-10-12 21:41:00,164 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 21:41:00,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:41:00,166 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 326 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:00,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 320 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 21:41:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 21:41:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:41:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 21:41:00,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-10-12 21:41:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:00,170 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 21:41:00,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 21:41:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 21:41:00,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 21:41:00,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-12 21:41:00,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-12 21:41:00,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:41:00,178 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:00,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.