./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_2.cil-1+token_ring.02.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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:11:27,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:11:27,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:11:27,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:11:27,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:11:27,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:11:27,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:11:27,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:11:27,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:11:27,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:11:27,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:11:27,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:11:27,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:11:27,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:11:27,468 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:11:27,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:11:27,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:11:27,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:11:27,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:11:27,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:11:27,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:11:27,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:11:27,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:11:27,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:11:27,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:11:27,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:11:27,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:11:27,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:11:27,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:11:27,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:11:27,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:11:27,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:11:27,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:27,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:11:27,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:11:27,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:11:27,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:11:27,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:11:27,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:11:27,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:11:27,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:11:27,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:11:27,478 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2024-10-14 05:11:27,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:11:27,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:11:27,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:11:27,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:11:27,761 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:11:27,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2024-10-14 05:11:29,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:11:29,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:11:29,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2024-10-14 05:11:29,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54160da9a/78ec8a68d21f49f1a729fb46d6db2933/FLAG390695a30 [2024-10-14 05:11:29,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54160da9a/78ec8a68d21f49f1a729fb46d6db2933 [2024-10-14 05:11:29,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:11:29,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:11:29,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:29,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:11:29,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:11:29,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:29,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a260ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29, skipping insertion in model container [2024-10-14 05:11:29,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:29,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:11:29,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2024-10-14 05:11:29,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2024-10-14 05:11:29,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:29,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:11:29,913 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2024-10-14 05:11:29,929 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2024-10-14 05:11:29,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:29,969 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:11:29,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29 WrapperNode [2024-10-14 05:11:29,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:29,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:29,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:11:29,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:11:29,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:29,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,026 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 468 [2024-10-14 05:11:30,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:30,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:11:30,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:11:30,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:11:30,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,066 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-14 05:11:30,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:11:30,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:11:30,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:11:30,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:11:30,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (1/1) ... [2024-10-14 05:11:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:30,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:30,134 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-14 05:11:30,140 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-14 05:11:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:11:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:11:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:11:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:11:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:11:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:11:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:11:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:11:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:11:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:11:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:11:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:11:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:11:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:11:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:11:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:11:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:11:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:11:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:11:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:11:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:11:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:11:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:11:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:11:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:11:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:11:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:11:30,315 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:11:30,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:11:30,975 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-14 05:11:30,975 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:11:31,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:11:31,034 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-14 05:11:31,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:31 BoogieIcfgContainer [2024-10-14 05:11:31,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:11:31,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:11:31,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:11:31,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:11:31,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:29" (1/3) ... [2024-10-14 05:11:31,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:31, skipping insertion in model container [2024-10-14 05:11:31,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:29" (2/3) ... [2024-10-14 05:11:31,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:31, skipping insertion in model container [2024-10-14 05:11:31,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:31" (3/3) ... [2024-10-14 05:11:31,043 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2024-10-14 05:11:31,059 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:11:31,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:11:31,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:11:31,147 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;@1d5f50ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:11:31,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:11:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 05:11:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:31,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:31,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:31,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash -998187491, now seen corresponding path program 1 times [2024-10-14 05:11:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:31,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135939656] [2024-10-14 05:11:31,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:31,575 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-14 05:11:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135939656] [2024-10-14 05:11:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135939656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861963474] [2024-10-14 05:11:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:31,615 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:32,361 INFO L93 Difference]: Finished difference Result 422 states and 654 transitions. [2024-10-14 05:11:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:11:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:32,378 INFO L225 Difference]: With dead ends: 422 [2024-10-14 05:11:32,378 INFO L226 Difference]: Without dead ends: 221 [2024-10-14 05:11:32,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:32,388 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 332 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:32,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 591 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-14 05:11:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2024-10-14 05:11:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 163 states have internal predecessors, (239), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 05:11:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 297 transitions. [2024-10-14 05:11:32,490 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 297 transitions. Word has length 58 [2024-10-14 05:11:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 297 transitions. [2024-10-14 05:11:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 297 transitions. [2024-10-14 05:11:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:32,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:32,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:32,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:11:32,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:32,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1030398619, now seen corresponding path program 1 times [2024-10-14 05:11:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981455666] [2024-10-14 05:11:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,767 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-14 05:11:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981455666] [2024-10-14 05:11:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981455666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:11:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361035887] [2024-10-14 05:11:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:32,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:11:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:11:32,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:32,773 INFO L87 Difference]: Start difference. First operand 204 states and 297 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:33,592 INFO L93 Difference]: Finished difference Result 410 states and 594 transitions. [2024-10-14 05:11:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:33,596 INFO L225 Difference]: With dead ends: 410 [2024-10-14 05:11:33,597 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 05:11:33,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:33,599 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 574 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 642 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:11:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 05:11:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2024-10-14 05:11:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 227 states have (on average 1.475770925110132) internal successors, (335), 233 states have internal predecessors, (335), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2024-10-14 05:11:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-10-14 05:11:33,654 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 58 [2024-10-14 05:11:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:33,655 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-10-14 05:11:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-10-14 05:11:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:33,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:33,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:33,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:11:33,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:33,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash -60763428, now seen corresponding path program 1 times [2024-10-14 05:11:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:33,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219830630] [2024-10-14 05:11:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:33,882 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-14 05:11:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219830630] [2024-10-14 05:11:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219830630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:33,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:11:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011831168] [2024-10-14 05:11:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:33,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:11:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:11:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:11:33,885 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:34,632 INFO L93 Difference]: Finished difference Result 486 states and 693 transitions. [2024-10-14 05:11:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 05:11:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:34,636 INFO L225 Difference]: With dead ends: 486 [2024-10-14 05:11:34,636 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 05:11:34,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:34,639 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 342 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:34,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 951 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:11:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 05:11:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 296. [2024-10-14 05:11:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 236 states have internal predecessors, (337), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2024-10-14 05:11:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2024-10-14 05:11:34,692 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 58 [2024-10-14 05:11:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:34,692 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2024-10-14 05:11:34,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2024-10-14 05:11:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:34,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:34,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:34,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:11:34,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220570, now seen corresponding path program 1 times [2024-10-14 05:11:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299546452] [2024-10-14 05:11:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:34,908 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-14 05:11:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299546452] [2024-10-14 05:11:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299546452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:11:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275026796] [2024-10-14 05:11:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:11:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:34,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:11:34,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:11:34,911 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 05:11:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:36,602 INFO L93 Difference]: Finished difference Result 1129 states and 1574 transitions. [2024-10-14 05:11:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:11:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-14 05:11:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:36,609 INFO L225 Difference]: With dead ends: 1129 [2024-10-14 05:11:36,610 INFO L226 Difference]: Without dead ends: 951 [2024-10-14 05:11:36,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:11:36,620 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1991 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:36,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 1106 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:11:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-14 05:11:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 834. [2024-10-14 05:11:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 649 states have (on average 1.4006163328197228) internal successors, (909), 663 states have internal predecessors, (909), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2024-10-14 05:11:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2024-10-14 05:11:36,719 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 58 [2024-10-14 05:11:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:36,719 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2024-10-14 05:11:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 05:11:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2024-10-14 05:11:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:11:36,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:36,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:36,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:11:36,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1408145877, now seen corresponding path program 1 times [2024-10-14 05:11:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:36,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171409017] [2024-10-14 05:11:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:36,855 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-14 05:11:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171409017] [2024-10-14 05:11:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171409017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:36,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:11:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125363523] [2024-10-14 05:11:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:36,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:11:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:11:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:11:36,858 INFO L87 Difference]: Start difference. First operand 834 states and 1121 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:37,643 INFO L93 Difference]: Finished difference Result 1644 states and 2193 transitions. [2024-10-14 05:11:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:11:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 05:11:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:37,650 INFO L225 Difference]: With dead ends: 1644 [2024-10-14 05:11:37,651 INFO L226 Difference]: Without dead ends: 934 [2024-10-14 05:11:37,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:37,654 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 235 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:37,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1060 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:11:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-14 05:11:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 850. [2024-10-14 05:11:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 661 states have (on average 1.3857791225416036) internal successors, (916), 675 states have internal predecessors, (916), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2024-10-14 05:11:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1132 transitions. [2024-10-14 05:11:37,728 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1132 transitions. Word has length 59 [2024-10-14 05:11:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:37,728 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1132 transitions. [2024-10-14 05:11:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1132 transitions. [2024-10-14 05:11:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:11:37,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:37,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:11:37,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 515082157, now seen corresponding path program 1 times [2024-10-14 05:11:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041164716] [2024-10-14 05:11:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:37,849 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-14 05:11:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041164716] [2024-10-14 05:11:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041164716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329047858] [2024-10-14 05:11:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:37,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:37,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:37,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:37,851 INFO L87 Difference]: Start difference. First operand 850 states and 1132 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:38,579 INFO L93 Difference]: Finished difference Result 2371 states and 3104 transitions. [2024-10-14 05:11:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:11:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-14 05:11:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:38,589 INFO L225 Difference]: With dead ends: 2371 [2024-10-14 05:11:38,590 INFO L226 Difference]: Without dead ends: 1646 [2024-10-14 05:11:38,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:38,593 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 571 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:38,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 647 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-10-14 05:11:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1514. [2024-10-14 05:11:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1158 states have (on average 1.3316062176165804) internal successors, (1542), 1184 states have internal predecessors, (1542), 178 states have call successors, (178), 141 states have call predecessors, (178), 176 states have return successors, (246), 190 states have call predecessors, (246), 176 states have call successors, (246) [2024-10-14 05:11:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1966 transitions. [2024-10-14 05:11:38,748 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1966 transitions. Word has length 59 [2024-10-14 05:11:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1966 transitions. [2024-10-14 05:11:38,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1966 transitions. [2024-10-14 05:11:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:38,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:38,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:38,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:11:38,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:38,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash -529059355, now seen corresponding path program 1 times [2024-10-14 05:11:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408500485] [2024-10-14 05:11:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,841 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-14 05:11:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408500485] [2024-10-14 05:11:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408500485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:38,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028225201] [2024-10-14 05:11:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:38,844 INFO L87 Difference]: Start difference. First operand 1514 states and 1966 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:39,598 INFO L93 Difference]: Finished difference Result 3681 states and 4738 transitions. [2024-10-14 05:11:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-14 05:11:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:39,612 INFO L225 Difference]: With dead ends: 3681 [2024-10-14 05:11:39,613 INFO L226 Difference]: Without dead ends: 2292 [2024-10-14 05:11:39,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:39,620 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 403 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:39,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 622 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2024-10-14 05:11:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2048. [2024-10-14 05:11:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.3164638052530429) internal successors, (2055), 1592 states have internal predecessors, (2055), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2024-10-14 05:11:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2626 transitions. [2024-10-14 05:11:39,815 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2626 transitions. Word has length 60 [2024-10-14 05:11:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:39,815 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 2626 transitions. [2024-10-14 05:11:39,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2626 transitions. [2024-10-14 05:11:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:39,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:39,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:39,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:11:39,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2816761, now seen corresponding path program 1 times [2024-10-14 05:11:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738606627] [2024-10-14 05:11:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:39,890 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-14 05:11:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738606627] [2024-10-14 05:11:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738606627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:39,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:11:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026527979] [2024-10-14 05:11:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:11:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:11:39,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:39,893 INFO L87 Difference]: Start difference. First operand 2048 states and 2626 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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-14 05:11:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:40,617 INFO L93 Difference]: Finished difference Result 2190 states and 2847 transitions. [2024-10-14 05:11:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:40,629 INFO L225 Difference]: With dead ends: 2190 [2024-10-14 05:11:40,630 INFO L226 Difference]: Without dead ends: 2078 [2024-10-14 05:11:40,631 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-14 05:11:40,632 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 361 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:40,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 426 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-10-14 05:11:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2048. [2024-10-14 05:11:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.315823190262652) internal successors, (2054), 1592 states have internal predecessors, (2054), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2024-10-14 05:11:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2625 transitions. [2024-10-14 05:11:40,872 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2625 transitions. Word has length 61 [2024-10-14 05:11:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 2625 transitions. [2024-10-14 05:11:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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-14 05:11:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2625 transitions. [2024-10-14 05:11:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:40,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:11:40,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1389602171, now seen corresponding path program 1 times [2024-10-14 05:11:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218426438] [2024-10-14 05:11:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,989 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-14 05:11:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218426438] [2024-10-14 05:11:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218426438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:40,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46545291] [2024-10-14 05:11:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:40,992 INFO L87 Difference]: Start difference. First operand 2048 states and 2625 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-14 05:11:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:42,071 INFO L93 Difference]: Finished difference Result 2323 states and 3051 transitions. [2024-10-14 05:11:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:42,082 INFO L225 Difference]: With dead ends: 2323 [2024-10-14 05:11:42,082 INFO L226 Difference]: Without dead ends: 2215 [2024-10-14 05:11:42,084 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-14 05:11:42,085 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 589 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:42,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 543 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:11:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2024-10-14 05:11:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2156. [2024-10-14 05:11:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1651 states have (on average 1.327680193821926) internal successors, (2192), 1683 states have internal predecessors, (2192), 253 states have call successors, (253), 202 states have call predecessors, (253), 250 states have return successors, (343), 272 states have call predecessors, (343), 251 states have call successors, (343) [2024-10-14 05:11:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2788 transitions. [2024-10-14 05:11:42,349 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2788 transitions. Word has length 61 [2024-10-14 05:11:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 2788 transitions. [2024-10-14 05:11:42,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-14 05:11:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2788 transitions. [2024-10-14 05:11:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:42,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:42,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:11:42,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 618846533, now seen corresponding path program 1 times [2024-10-14 05:11:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030566047] [2024-10-14 05:11:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,497 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-14 05:11:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030566047] [2024-10-14 05:11:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030566047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:42,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:42,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44022332] [2024-10-14 05:11:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:42,500 INFO L87 Difference]: Start difference. First operand 2156 states and 2788 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:43,836 INFO L93 Difference]: Finished difference Result 2568 states and 3417 transitions. [2024-10-14 05:11:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:43,850 INFO L225 Difference]: With dead ends: 2568 [2024-10-14 05:11:43,850 INFO L226 Difference]: Without dead ends: 2352 [2024-10-14 05:11:43,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:43,852 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 594 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:43,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 883 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2024-10-14 05:11:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2257. [2024-10-14 05:11:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1734 states have (on average 1.3356401384083045) internal successors, (2316), 1767 states have internal predecessors, (2316), 264 states have call successors, (264), 208 states have call predecessors, (264), 257 states have return successors, (356), 284 states have call predecessors, (356), 262 states have call successors, (356) [2024-10-14 05:11:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2936 transitions. [2024-10-14 05:11:44,179 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2936 transitions. Word has length 61 [2024-10-14 05:11:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:44,180 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2936 transitions. [2024-10-14 05:11:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2936 transitions. [2024-10-14 05:11:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:44,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:44,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:44,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:11:44,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:44,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 603327815, now seen corresponding path program 1 times [2024-10-14 05:11:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:44,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371734209] [2024-10-14 05:11:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,304 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-14 05:11:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371734209] [2024-10-14 05:11:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371734209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:44,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573988335] [2024-10-14 05:11:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:44,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:44,307 INFO L87 Difference]: Start difference. First operand 2257 states and 2936 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:45,710 INFO L93 Difference]: Finished difference Result 2989 states and 4049 transitions. [2024-10-14 05:11:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:45,727 INFO L225 Difference]: With dead ends: 2989 [2024-10-14 05:11:45,727 INFO L226 Difference]: Without dead ends: 2672 [2024-10-14 05:11:45,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:45,731 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 608 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:45,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 874 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:11:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2024-10-14 05:11:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 2459. [2024-10-14 05:11:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1902 states have (on average 1.35068349106204) internal successors, (2569), 1937 states have internal predecessors, (2569), 284 states have call successors, (284), 220 states have call predecessors, (284), 271 states have return successors, (384), 306 states have call predecessors, (384), 282 states have call successors, (384) [2024-10-14 05:11:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3237 transitions. [2024-10-14 05:11:46,043 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3237 transitions. Word has length 61 [2024-10-14 05:11:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:46,043 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 3237 transitions. [2024-10-14 05:11:46,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3237 transitions. [2024-10-14 05:11:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:46,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:46,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:46,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:11:46,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:46,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 250239433, now seen corresponding path program 1 times [2024-10-14 05:11:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633460179] [2024-10-14 05:11:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,169 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-14 05:11:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633460179] [2024-10-14 05:11:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633460179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856680238] [2024-10-14 05:11:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:46,171 INFO L87 Difference]: Start difference. First operand 2459 states and 3237 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:47,551 INFO L93 Difference]: Finished difference Result 3693 states and 5100 transitions. [2024-10-14 05:11:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:47,569 INFO L225 Difference]: With dead ends: 3693 [2024-10-14 05:11:47,569 INFO L226 Difference]: Without dead ends: 3174 [2024-10-14 05:11:47,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:47,573 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 635 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:47,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 870 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2024-10-14 05:11:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2840. [2024-10-14 05:11:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3716734325665314) internal successors, (3041), 2256 states have internal predecessors, (3041), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2024-10-14 05:11:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3807 transitions. [2024-10-14 05:11:47,925 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3807 transitions. Word has length 61 [2024-10-14 05:11:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:47,926 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 3807 transitions. [2024-10-14 05:11:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3807 transitions. [2024-10-14 05:11:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:47,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:47,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:11:47,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2116455161, now seen corresponding path program 1 times [2024-10-14 05:11:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674980171] [2024-10-14 05:11:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:48,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:48,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674980171] [2024-10-14 05:11:48,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674980171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:48,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740323977] [2024-10-14 05:11:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:48,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:48,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:48,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:48,030 INFO L87 Difference]: Start difference. First operand 2840 states and 3807 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:48,869 INFO L93 Difference]: Finished difference Result 3953 states and 5505 transitions. [2024-10-14 05:11:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:48,885 INFO L225 Difference]: With dead ends: 3953 [2024-10-14 05:11:48,886 INFO L226 Difference]: Without dead ends: 3053 [2024-10-14 05:11:48,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:48,890 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 589 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:48,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 456 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2024-10-14 05:11:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2840. [2024-10-14 05:11:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3676138926477222) internal successors, (3032), 2256 states have internal predecessors, (3032), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2024-10-14 05:11:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3798 transitions. [2024-10-14 05:11:49,354 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3798 transitions. Word has length 61 [2024-10-14 05:11:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:49,355 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 3798 transitions. [2024-10-14 05:11:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3798 transitions. [2024-10-14 05:11:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:49,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:49,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:49,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:11:49,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:49,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1222968823, now seen corresponding path program 1 times [2024-10-14 05:11:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685540269] [2024-10-14 05:11:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,454 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-14 05:11:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685540269] [2024-10-14 05:11:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685540269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103848491] [2024-10-14 05:11:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:49,457 INFO L87 Difference]: Start difference. First operand 2840 states and 3798 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-14 05:11:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:50,320 INFO L93 Difference]: Finished difference Result 3950 states and 5484 transitions. [2024-10-14 05:11:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:50,340 INFO L225 Difference]: With dead ends: 3950 [2024-10-14 05:11:50,341 INFO L226 Difference]: Without dead ends: 3051 [2024-10-14 05:11:50,344 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-14 05:11:50,345 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 229 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:50,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 649 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-10-14 05:11:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2858. [2024-10-14 05:11:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2235 states have (on average 1.3646532438478747) internal successors, (3050), 2274 states have internal predecessors, (3050), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2024-10-14 05:11:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3816 transitions. [2024-10-14 05:11:50,693 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3816 transitions. Word has length 61 [2024-10-14 05:11:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 2858 states and 3816 transitions. [2024-10-14 05:11:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-14 05:11:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3816 transitions. [2024-10-14 05:11:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:50,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:50,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:11:50,698 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -563437301, now seen corresponding path program 1 times [2024-10-14 05:11:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171572241] [2024-10-14 05:11:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:11:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,852 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-14 05:11:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171572241] [2024-10-14 05:11:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171572241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013401917] [2024-10-14 05:11:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:50,856 INFO L87 Difference]: Start difference. First operand 2858 states and 3816 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:52,450 INFO L93 Difference]: Finished difference Result 6063 states and 8730 transitions. [2024-10-14 05:11:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:11:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-14 05:11:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:52,474 INFO L225 Difference]: With dead ends: 6063 [2024-10-14 05:11:52,474 INFO L226 Difference]: Without dead ends: 5146 [2024-10-14 05:11:52,481 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-14 05:11:52,482 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1290 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:52,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 728 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:11:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2024-10-14 05:11:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 4624. [2024-10-14 05:11:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 3689 states have (on average 1.399566278124153) internal successors, (5163), 3759 states have internal predecessors, (5163), 506 states have call successors, (506), 356 states have call predecessors, (506), 427 states have return successors, (743), 517 states have call predecessors, (743), 504 states have call successors, (743) [2024-10-14 05:11:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6412 transitions. [2024-10-14 05:11:53,137 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6412 transitions. Word has length 61 [2024-10-14 05:11:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:53,137 INFO L471 AbstractCegarLoop]: Abstraction has 4624 states and 6412 transitions. [2024-10-14 05:11:53,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-14 05:11:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6412 transitions. [2024-10-14 05:11:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:11:53,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:53,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:53,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:11:53,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:53,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1574279004, now seen corresponding path program 1 times [2024-10-14 05:11:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738383823] [2024-10-14 05:11:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:53,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-14 05:11:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738383823] [2024-10-14 05:11:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738383823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974784907] [2024-10-14 05:11:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:53,223 INFO L87 Difference]: Start difference. First operand 4624 states and 6412 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:54,079 INFO L93 Difference]: Finished difference Result 6967 states and 9360 transitions. [2024-10-14 05:11:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-14 05:11:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:54,104 INFO L225 Difference]: With dead ends: 6967 [2024-10-14 05:11:54,104 INFO L226 Difference]: Without dead ends: 5043 [2024-10-14 05:11:54,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:54,114 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 530 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:54,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 573 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:11:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2024-10-14 05:11:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 4800. [2024-10-14 05:11:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4800 states, 3826 states have (on average 1.3936225823314166) internal successors, (5332), 3898 states have internal predecessors, (5332), 525 states have call successors, (525), 373 states have call predecessors, (525), 447 states have return successors, (765), 537 states have call predecessors, (765), 523 states have call successors, (765) [2024-10-14 05:11:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4800 states to 4800 states and 6622 transitions. [2024-10-14 05:11:54,578 INFO L78 Accepts]: Start accepts. Automaton has 4800 states and 6622 transitions. Word has length 66 [2024-10-14 05:11:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:54,578 INFO L471 AbstractCegarLoop]: Abstraction has 4800 states and 6622 transitions. [2024-10-14 05:11:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4800 states and 6622 transitions. [2024-10-14 05:11:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:11:54,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:54,581 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:54,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:11:54,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:54,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2074207797, now seen corresponding path program 1 times [2024-10-14 05:11:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864449210] [2024-10-14 05:11:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864449210] [2024-10-14 05:11:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864449210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:54,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340344502] [2024-10-14 05:11:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:54,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:54,665 INFO L87 Difference]: Start difference. First operand 4800 states and 6622 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:55,956 INFO L93 Difference]: Finished difference Result 5644 states and 7650 transitions. [2024-10-14 05:11:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:11:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-14 05:11:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:55,983 INFO L225 Difference]: With dead ends: 5644 [2024-10-14 05:11:55,983 INFO L226 Difference]: Without dead ends: 5641 [2024-10-14 05:11:55,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:55,987 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 819 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:55,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 550 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2024-10-14 05:11:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5078. [2024-10-14 05:11:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4033 states have (on average 1.385569055293826) internal successors, (5588), 4108 states have internal predecessors, (5588), 557 states have call successors, (557), 401 states have call predecessors, (557), 486 states have return successors, (816), 577 states have call predecessors, (816), 556 states have call successors, (816) [2024-10-14 05:11:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 6961 transitions. [2024-10-14 05:11:56,783 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 6961 transitions. Word has length 67 [2024-10-14 05:11:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:56,784 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 6961 transitions. [2024-10-14 05:11:56,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 6961 transitions. [2024-10-14 05:11:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:11:56,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:56,786 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:11:56,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash 123364814, now seen corresponding path program 1 times [2024-10-14 05:11:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152144509] [2024-10-14 05:11:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152144509] [2024-10-14 05:11:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152144509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641280965] [2024-10-14 05:11:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:56,929 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-14 05:11:56,932 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-14 05:11:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:57,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:11:57,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:57,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:11:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641280965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:11:57,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:11:57,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:11:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687519666] [2024-10-14 05:11:57,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:11:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:11:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:11:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:11:57,426 INFO L87 Difference]: Start difference. First operand 5078 states and 6961 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:11:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:59,776 INFO L93 Difference]: Finished difference Result 8251 states and 10870 transitions. [2024-10-14 05:11:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 05:11:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-14 05:11:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:59,804 INFO L225 Difference]: With dead ends: 8251 [2024-10-14 05:11:59,804 INFO L226 Difference]: Without dead ends: 8248 [2024-10-14 05:11:59,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-14 05:11:59,810 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1155 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:59,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1197 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:11:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2024-10-14 05:12:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 7406. [2024-10-14 05:12:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7406 states, 5799 states have (on average 1.3524745645801) internal successors, (7843), 5901 states have internal predecessors, (7843), 828 states have call successors, (828), 636 states have call predecessors, (828), 777 states have return successors, (1188), 877 states have call predecessors, (1188), 827 states have call successors, (1188) [2024-10-14 05:12:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7406 states to 7406 states and 9859 transitions. [2024-10-14 05:12:00,689 INFO L78 Accepts]: Start accepts. Automaton has 7406 states and 9859 transitions. Word has length 68 [2024-10-14 05:12:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 7406 states and 9859 transitions. [2024-10-14 05:12:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:12:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7406 states and 9859 transitions. [2024-10-14 05:12:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:00,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:00,693 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:00,712 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-14 05:12:00,894 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,SelfDestructingSolverStorable17 [2024-10-14 05:12:00,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:00,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2067840267, now seen corresponding path program 2 times [2024-10-14 05:12:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050150453] [2024-10-14 05:12:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050150453] [2024-10-14 05:12:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050150453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:00,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:12:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318501506] [2024-10-14 05:12:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:00,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:12:00,961 INFO L87 Difference]: Start difference. First operand 7406 states and 9859 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:12:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:02,393 INFO L93 Difference]: Finished difference Result 9581 states and 12579 transitions. [2024-10-14 05:12:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:12:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-14 05:12:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:02,422 INFO L225 Difference]: With dead ends: 9581 [2024-10-14 05:12:02,423 INFO L226 Difference]: Without dead ends: 5340 [2024-10-14 05:12:02,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:12:02,437 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 597 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:02,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 482 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:12:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2024-10-14 05:12:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 4708. [2024-10-14 05:12:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 3767 states have (on average 1.3801433501460048) internal successors, (5199), 3831 states have internal predecessors, (5199), 513 states have call successors, (513), 367 states have call predecessors, (513), 426 states have return successors, (731), 518 states have call predecessors, (731), 512 states have call successors, (731) [2024-10-14 05:12:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 6443 transitions. [2024-10-14 05:12:03,144 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 6443 transitions. Word has length 71 [2024-10-14 05:12:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:03,144 INFO L471 AbstractCegarLoop]: Abstraction has 4708 states and 6443 transitions. [2024-10-14 05:12:03,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:12:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 6443 transitions. [2024-10-14 05:12:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:12:03,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:03,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:03,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:12:03,149 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash -963374144, now seen corresponding path program 1 times [2024-10-14 05:12:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647113212] [2024-10-14 05:12:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,271 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-14 05:12:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647113212] [2024-10-14 05:12:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647113212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145524383] [2024-10-14 05:12:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:03,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:03,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:03,274 INFO L87 Difference]: Start difference. First operand 4708 states and 6443 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:04,791 INFO L93 Difference]: Finished difference Result 8820 states and 11509 transitions. [2024-10-14 05:12:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:12:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-14 05:12:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:04,816 INFO L225 Difference]: With dead ends: 8820 [2024-10-14 05:12:04,816 INFO L226 Difference]: Without dead ends: 6234 [2024-10-14 05:12:04,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:12:04,825 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 677 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:04,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 832 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:12:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2024-10-14 05:12:05,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5989. [2024-10-14 05:12:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5989 states, 4720 states have (on average 1.3427966101694915) internal successors, (6338), 4814 states have internal predecessors, (6338), 663 states have call successors, (663), 495 states have call predecessors, (663), 604 states have return successors, (992), 688 states have call predecessors, (992), 662 states have call successors, (992) [2024-10-14 05:12:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 7993 transitions. [2024-10-14 05:12:05,656 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 7993 transitions. Word has length 76 [2024-10-14 05:12:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 5989 states and 7993 transitions. [2024-10-14 05:12:05,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 7993 transitions. [2024-10-14 05:12:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:12:05,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:05,663 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:12:05,663 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1927183056, now seen corresponding path program 1 times [2024-10-14 05:12:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526281494] [2024-10-14 05:12:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:12:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:12:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:05,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526281494] [2024-10-14 05:12:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526281494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:12:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559370287] [2024-10-14 05:12:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:05,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:12:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:05,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:12:05,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:05,806 INFO L87 Difference]: Start difference. First operand 5989 states and 7993 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:07,371 INFO L93 Difference]: Finished difference Result 8427 states and 10987 transitions. [2024-10-14 05:12:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:12:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-14 05:12:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:07,397 INFO L225 Difference]: With dead ends: 8427 [2024-10-14 05:12:07,397 INFO L226 Difference]: Without dead ends: 5500 [2024-10-14 05:12:07,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-14 05:12:07,410 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1092 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:07,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 835 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:12:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2024-10-14 05:12:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 5134. [2024-10-14 05:12:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5134 states, 4062 states have (on average 1.3505662235352043) internal successors, (5486), 4145 states have internal predecessors, (5486), 563 states have call successors, (563), 408 states have call predecessors, (563), 507 states have return successors, (828), 589 states have call predecessors, (828), 562 states have call successors, (828) [2024-10-14 05:12:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5134 states to 5134 states and 6877 transitions. [2024-10-14 05:12:08,417 INFO L78 Accepts]: Start accepts. Automaton has 5134 states and 6877 transitions. Word has length 86 [2024-10-14 05:12:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 5134 states and 6877 transitions. [2024-10-14 05:12:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 6877 transitions. [2024-10-14 05:12:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 05:12:08,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:08,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:12:08,426 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:08,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2032509986, now seen corresponding path program 1 times [2024-10-14 05:12:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468801182] [2024-10-14 05:12:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:12:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 05:12:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 05:12:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468801182] [2024-10-14 05:12:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468801182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303623763] [2024-10-14 05:12:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:08,537 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-14 05:12:08,538 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-14 05:12:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:08,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:08,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:12:08,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303623763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809563069] [2024-10-14 05:12:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:08,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:08,674 INFO L87 Difference]: Start difference. First operand 5134 states and 6877 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-14 05:12:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:09,591 INFO L93 Difference]: Finished difference Result 8010 states and 11218 transitions. [2024-10-14 05:12:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:09,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 99 [2024-10-14 05:12:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:09,616 INFO L225 Difference]: With dead ends: 8010 [2024-10-14 05:12:09,616 INFO L226 Difference]: Without dead ends: 5620 [2024-10-14 05:12:09,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-14 05:12:09,625 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 133 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:09,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 659 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2024-10-14 05:12:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 5620. [2024-10-14 05:12:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 4465 states have (on average 1.3594624860022397) internal successors, (6070), 4552 states have internal predecessors, (6070), 612 states have call successors, (612), 438 states have call predecessors, (612), 541 states have return successors, (906), 638 states have call predecessors, (906), 611 states have call successors, (906) [2024-10-14 05:12:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 7588 transitions. [2024-10-14 05:12:10,369 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 7588 transitions. Word has length 99 [2024-10-14 05:12:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:10,369 INFO L471 AbstractCegarLoop]: Abstraction has 5620 states and 7588 transitions. [2024-10-14 05:12:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-14 05:12:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 7588 transitions. [2024-10-14 05:12:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:12:10,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:10,380 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:10,400 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-14 05:12:10,580 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,SelfDestructingSolverStorable21 [2024-10-14 05:12:10,581 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1291156472, now seen corresponding path program 1 times [2024-10-14 05:12:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312663771] [2024-10-14 05:12:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:12:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:12:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:12:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:12:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:12:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:12:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-14 05:12:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312663771] [2024-10-14 05:12:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312663771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921151877] [2024-10-14 05:12:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:10,754 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-14 05:12:10,757 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-14 05:12:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:10,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:12:10,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:12:10,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921151877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:12:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077245091] [2024-10-14 05:12:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:10,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:12:10,914 INFO L87 Difference]: Start difference. First operand 5620 states and 7588 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:12:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:11,426 INFO L93 Difference]: Finished difference Result 6870 states and 9108 transitions. [2024-10-14 05:12:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:12:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-14 05:12:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:11,448 INFO L225 Difference]: With dead ends: 6870 [2024-10-14 05:12:11,449 INFO L226 Difference]: Without dead ends: 4437 [2024-10-14 05:12:11,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:12:11,457 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:11,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1333 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:12:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2024-10-14 05:12:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4437. [2024-10-14 05:12:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 3621 states have (on average 1.3916045291355978) internal successors, (5039), 3677 states have internal predecessors, (5039), 454 states have call successors, (454), 297 states have call predecessors, (454), 360 states have return successors, (685), 470 states have call predecessors, (685), 453 states have call successors, (685) [2024-10-14 05:12:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 6178 transitions. [2024-10-14 05:12:11,991 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 6178 transitions. Word has length 131 [2024-10-14 05:12:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:11,991 INFO L471 AbstractCegarLoop]: Abstraction has 4437 states and 6178 transitions. [2024-10-14 05:12:11,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:12:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 6178 transitions. [2024-10-14 05:12:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 05:12:12,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:12,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:12,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:12,204 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2058872139, now seen corresponding path program 1 times [2024-10-14 05:12:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131081243] [2024-10-14 05:12:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:12:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 05:12:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 05:12:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 05:12:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131081243] [2024-10-14 05:12:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131081243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:12,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105185100] [2024-10-14 05:12:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:12,328 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-14 05:12:12,330 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-14 05:12:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:12,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:12,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 05:12:12,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105185100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:12:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794232596] [2024-10-14 05:12:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:12,567 INFO L87 Difference]: Start difference. First operand 4437 states and 6178 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:12:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:13,059 INFO L93 Difference]: Finished difference Result 7861 states and 11318 transitions. [2024-10-14 05:12:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2024-10-14 05:12:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:13,085 INFO L225 Difference]: With dead ends: 7861 [2024-10-14 05:12:13,086 INFO L226 Difference]: Without dead ends: 5885 [2024-10-14 05:12:13,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-14 05:12:13,097 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 207 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:13,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 406 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5885 states. [2024-10-14 05:12:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5885 to 5854. [2024-10-14 05:12:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 4798 states have (on average 1.4076698624426844) internal successors, (6754), 4871 states have internal predecessors, (6754), 594 states have call successors, (594), 385 states have call predecessors, (594), 460 states have return successors, (886), 605 states have call predecessors, (886), 593 states have call successors, (886) [2024-10-14 05:12:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 8234 transitions. [2024-10-14 05:12:13,817 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 8234 transitions. Word has length 127 [2024-10-14 05:12:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:13,818 INFO L471 AbstractCegarLoop]: Abstraction has 5854 states and 8234 transitions. [2024-10-14 05:12:13,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:12:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 8234 transitions. [2024-10-14 05:12:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 05:12:13,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:13,826 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:13,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:14,027 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 464624182, now seen corresponding path program 1 times [2024-10-14 05:12:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932744246] [2024-10-14 05:12:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:12:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 05:12:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 05:12:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 05:12:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932744246] [2024-10-14 05:12:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932744246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619190701] [2024-10-14 05:12:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:14,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:14,137 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-14 05:12:14,139 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-14 05:12:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:14,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:14,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:12:14,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619190701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:12:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918628497] [2024-10-14 05:12:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:14,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:14,349 INFO L87 Difference]: Start difference. First operand 5854 states and 8234 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-14 05:12:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:15,132 INFO L93 Difference]: Finished difference Result 14858 states and 21628 transitions. [2024-10-14 05:12:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 127 [2024-10-14 05:12:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:15,176 INFO L225 Difference]: With dead ends: 14858 [2024-10-14 05:12:15,176 INFO L226 Difference]: Without dead ends: 10272 [2024-10-14 05:12:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-14 05:12:15,197 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 212 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 405 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2024-10-14 05:12:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 10222. [2024-10-14 05:12:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10222 states, 8415 states have (on average 1.4228163992869876) internal successors, (11973), 8548 states have internal predecessors, (11973), 1026 states have call successors, (1026), 664 states have call predecessors, (1026), 779 states have return successors, (1530), 1017 states have call predecessors, (1530), 1025 states have call successors, (1530) [2024-10-14 05:12:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10222 states to 10222 states and 14529 transitions. [2024-10-14 05:12:16,262 INFO L78 Accepts]: Start accepts. Automaton has 10222 states and 14529 transitions. Word has length 127 [2024-10-14 05:12:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 10222 states and 14529 transitions. [2024-10-14 05:12:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-14 05:12:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 10222 states and 14529 transitions. [2024-10-14 05:12:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:12:16,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:16,276 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:16,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 05:12:16,476 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,SelfDestructingSolverStorable24 [2024-10-14 05:12:16,477 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -506822965, now seen corresponding path program 1 times [2024-10-14 05:12:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216314499] [2024-10-14 05:12:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:12:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:12:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 05:12:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 05:12:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:12:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:12:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 05:12:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 05:12:16,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216314499] [2024-10-14 05:12:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216314499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:16,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950300830] [2024-10-14 05:12:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:16,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:16,601 INFO L87 Difference]: Start difference. First operand 10222 states and 14529 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:12:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:18,245 INFO L93 Difference]: Finished difference Result 11377 states and 15917 transitions. [2024-10-14 05:12:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:12:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-14 05:12:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:18,290 INFO L225 Difference]: With dead ends: 11377 [2024-10-14 05:12:18,290 INFO L226 Difference]: Without dead ends: 10215 [2024-10-14 05:12:18,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:12:18,300 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 373 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:18,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 697 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:12:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2024-10-14 05:12:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 10130. [2024-10-14 05:12:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10130 states, 8345 states have (on average 1.4248052726183342) internal successors, (11890), 8478 states have internal predecessors, (11890), 1015 states have call successors, (1015), 655 states have call predecessors, (1015), 768 states have return successors, (1514), 1004 states have call predecessors, (1514), 1014 states have call successors, (1514) [2024-10-14 05:12:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10130 states to 10130 states and 14419 transitions. [2024-10-14 05:12:19,266 INFO L78 Accepts]: Start accepts. Automaton has 10130 states and 14419 transitions. Word has length 145 [2024-10-14 05:12:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:19,266 INFO L471 AbstractCegarLoop]: Abstraction has 10130 states and 14419 transitions. [2024-10-14 05:12:19,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:12:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10130 states and 14419 transitions. [2024-10-14 05:12:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 05:12:19,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:19,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:19,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:12:19,278 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1362634231, now seen corresponding path program 1 times [2024-10-14 05:12:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227545530] [2024-10-14 05:12:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:12:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:12:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 05:12:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 05:12:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:12:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:12:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 05:12:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-14 05:12:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227545530] [2024-10-14 05:12:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227545530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470623314] [2024-10-14 05:12:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:19,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:19,520 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-14 05:12:19,522 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-14 05:12:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:19,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 05:12:19,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:12:19,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470623314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:19,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-10-14 05:12:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651548212] [2024-10-14 05:12:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:12:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:12:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:12:19,790 INFO L87 Difference]: Start difference. First operand 10130 states and 14419 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 05:12:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:20,941 INFO L93 Difference]: Finished difference Result 12267 states and 17040 transitions. [2024-10-14 05:12:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:12:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2024-10-14 05:12:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:20,970 INFO L225 Difference]: With dead ends: 12267 [2024-10-14 05:12:20,970 INFO L226 Difference]: Without dead ends: 10985 [2024-10-14 05:12:20,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:12:20,979 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 165 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:20,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 421 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:12:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2024-10-14 05:12:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 10946. [2024-10-14 05:12:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10946 states, 9009 states have (on average 1.4052614052614052) internal successors, (12660), 9147 states have internal predecessors, (12660), 1089 states have call successors, (1089), 710 states have call predecessors, (1089), 846 states have return successors, (1630), 1096 states have call predecessors, (1630), 1088 states have call successors, (1630) [2024-10-14 05:12:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10946 states to 10946 states and 15379 transitions. [2024-10-14 05:12:22,100 INFO L78 Accepts]: Start accepts. Automaton has 10946 states and 15379 transitions. Word has length 147 [2024-10-14 05:12:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:22,100 INFO L471 AbstractCegarLoop]: Abstraction has 10946 states and 15379 transitions. [2024-10-14 05:12:22,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 05:12:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 10946 states and 15379 transitions. [2024-10-14 05:12:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 05:12:22,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:22,112 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:22,125 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-14 05:12:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 05:12:22,313 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1215288766, now seen corresponding path program 1 times [2024-10-14 05:12:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974949837] [2024-10-14 05:12:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:22,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 05:12:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:12:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:12:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 05:12:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 05:12:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:22,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974949837] [2024-10-14 05:12:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974949837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:22,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34512038] [2024-10-14 05:12:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:22,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:22,435 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-14 05:12:22,436 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-14 05:12:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:22,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:22,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 05:12:22,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34512038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890714955] [2024-10-14 05:12:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:22,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:22,620 INFO L87 Difference]: Start difference. First operand 10946 states and 15379 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:12:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:23,361 INFO L93 Difference]: Finished difference Result 16163 states and 22994 transitions. [2024-10-14 05:12:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-10-14 05:12:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:23,391 INFO L225 Difference]: With dead ends: 16163 [2024-10-14 05:12:23,391 INFO L226 Difference]: Without dead ends: 8240 [2024-10-14 05:12:23,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-14 05:12:23,413 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 229 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:23,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 291 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2024-10-14 05:12:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 7780. [2024-10-14 05:12:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7780 states, 6408 states have (on average 1.34019975031211) internal successors, (8588), 6480 states have internal predecessors, (8588), 750 states have call successors, (750), 526 states have call predecessors, (750), 620 states have return successors, (1000), 777 states have call predecessors, (1000), 749 states have call successors, (1000) [2024-10-14 05:12:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7780 states to 7780 states and 10338 transitions. [2024-10-14 05:12:24,307 INFO L78 Accepts]: Start accepts. Automaton has 7780 states and 10338 transitions. Word has length 143 [2024-10-14 05:12:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:24,308 INFO L471 AbstractCegarLoop]: Abstraction has 7780 states and 10338 transitions. [2024-10-14 05:12:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:12:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7780 states and 10338 transitions. [2024-10-14 05:12:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 05:12:24,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:24,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:24,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:24,516 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:24,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1773310113, now seen corresponding path program 1 times [2024-10-14 05:12:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702643577] [2024-10-14 05:12:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 05:12:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:12:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 05:12:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 05:12:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 05:12:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702643577] [2024-10-14 05:12:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702643577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373431527] [2024-10-14 05:12:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:24,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:24,629 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-14 05:12:24,631 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-14 05:12:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:12:24,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-14 05:12:24,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373431527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:24,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677883342] [2024-10-14 05:12:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:24,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:24,759 INFO L87 Difference]: Start difference. First operand 7780 states and 10338 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-14 05:12:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:25,598 INFO L93 Difference]: Finished difference Result 14075 states and 18960 transitions. [2024-10-14 05:12:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:25,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 143 [2024-10-14 05:12:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:25,627 INFO L225 Difference]: With dead ends: 14075 [2024-10-14 05:12:25,627 INFO L226 Difference]: Without dead ends: 8288 [2024-10-14 05:12:25,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-14 05:12:25,646 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 264 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:25,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 411 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8288 states. [2024-10-14 05:12:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8288 to 8163. [2024-10-14 05:12:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 6754 states have (on average 1.3140361267397098) internal successors, (8875), 6821 states have internal predecessors, (8875), 752 states have call successors, (752), 558 states have call predecessors, (752), 655 states have return successors, (996), 787 states have call predecessors, (996), 751 states have call successors, (996) [2024-10-14 05:12:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 10623 transitions. [2024-10-14 05:12:26,539 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 10623 transitions. Word has length 143 [2024-10-14 05:12:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:26,540 INFO L471 AbstractCegarLoop]: Abstraction has 8163 states and 10623 transitions. [2024-10-14 05:12:26,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-14 05:12:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 10623 transitions. [2024-10-14 05:12:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 05:12:26,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:26,546 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:26,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:26,748 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,SelfDestructingSolverStorable28 [2024-10-14 05:12:26,748 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2054969746, now seen corresponding path program 1 times [2024-10-14 05:12:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442240881] [2024-10-14 05:12:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:12:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 05:12:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 05:12:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 05:12:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 05:12:26,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442240881] [2024-10-14 05:12:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442240881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996534840] [2024-10-14 05:12:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:26,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:26,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:26,852 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-14 05:12:26,854 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-14 05:12:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:26,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:26,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:12:26,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996534840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366444367] [2024-10-14 05:12:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:26,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:26,990 INFO L87 Difference]: Start difference. First operand 8163 states and 10623 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-14 05:12:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:28,223 INFO L93 Difference]: Finished difference Result 19560 states and 26082 transitions. [2024-10-14 05:12:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:28,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 144 [2024-10-14 05:12:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:28,283 INFO L225 Difference]: With dead ends: 19560 [2024-10-14 05:12:28,284 INFO L226 Difference]: Without dead ends: 13390 [2024-10-14 05:12:28,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-14 05:12:28,301 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 132 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:28,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 661 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13390 states. [2024-10-14 05:12:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13390 to 13388. [2024-10-14 05:12:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13388 states, 11076 states have (on average 1.3210545323221379) internal successors, (14632), 11193 states have internal predecessors, (14632), 1259 states have call successors, (1259), 913 states have call predecessors, (1259), 1051 states have return successors, (1831), 1289 states have call predecessors, (1831), 1258 states have call successors, (1831) [2024-10-14 05:12:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13388 states to 13388 states and 17722 transitions. [2024-10-14 05:12:29,678 INFO L78 Accepts]: Start accepts. Automaton has 13388 states and 17722 transitions. Word has length 144 [2024-10-14 05:12:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 13388 states and 17722 transitions. [2024-10-14 05:12:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-14 05:12:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13388 states and 17722 transitions. [2024-10-14 05:12:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:12:29,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:29,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-14 05:12:29,703 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-14 05:12:29,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:29,891 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:29,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1683603920, now seen corresponding path program 1 times [2024-10-14 05:12:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275440699] [2024-10-14 05:12:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:12:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:12:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 05:12:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 05:12:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-14 05:12:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275440699] [2024-10-14 05:12:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275440699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580773645] [2024-10-14 05:12:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:30,010 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-14 05:12:30,011 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-14 05:12:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:30,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:12:30,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 05:12:30,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580773645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:30,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:30,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977323737] [2024-10-14 05:12:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:30,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:30,148 INFO L87 Difference]: Start difference. First operand 13388 states and 17722 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:12:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:32,162 INFO L93 Difference]: Finished difference Result 35627 states and 48288 transitions. [2024-10-14 05:12:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 145 [2024-10-14 05:12:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:32,227 INFO L225 Difference]: With dead ends: 35627 [2024-10-14 05:12:32,227 INFO L226 Difference]: Without dead ends: 24236 [2024-10-14 05:12:32,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-14 05:12:32,245 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 248 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:32,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 432 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2024-10-14 05:12:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 24022. [2024-10-14 05:12:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24022 states, 19948 states have (on average 1.3205333868056948) internal successors, (26342), 20165 states have internal predecessors, (26342), 2229 states have call successors, (2229), 1629 states have call predecessors, (2229), 1843 states have return successors, (3908), 2243 states have call predecessors, (3908), 2228 states have call successors, (3908) [2024-10-14 05:12:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24022 states to 24022 states and 32479 transitions. [2024-10-14 05:12:34,419 INFO L78 Accepts]: Start accepts. Automaton has 24022 states and 32479 transitions. Word has length 145 [2024-10-14 05:12:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:34,419 INFO L471 AbstractCegarLoop]: Abstraction has 24022 states and 32479 transitions. [2024-10-14 05:12:34,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:12:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24022 states and 32479 transitions. [2024-10-14 05:12:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:12:34,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:34,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:34,450 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-14 05:12:34,637 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,SelfDestructingSolverStorable30 [2024-10-14 05:12:34,637 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 475994830, now seen corresponding path program 1 times [2024-10-14 05:12:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656930357] [2024-10-14 05:12:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:12:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:12:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:12:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:12:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:12:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 05:12:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 05:12:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 05:12:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656930357] [2024-10-14 05:12:34,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656930357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:34,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:12:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638210429] [2024-10-14 05:12:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:12:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:34,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:12:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:12:34,705 INFO L87 Difference]: Start difference. First operand 24022 states and 32479 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:37,144 INFO L93 Difference]: Finished difference Result 44109 states and 59820 transitions. [2024-10-14 05:12:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:12:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 145 [2024-10-14 05:12:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:37,217 INFO L225 Difference]: With dead ends: 44109 [2024-10-14 05:12:37,217 INFO L226 Difference]: Without dead ends: 22082 [2024-10-14 05:12:37,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 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-14 05:12:37,263 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 390 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:37,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 410 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:12:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22082 states.