./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:06:22,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:06:22,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:06:22,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:06:22,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:06:22,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:06:22,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:06:22,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:06:22,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:06:22,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:06:22,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:06:22,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:06:22,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:06:22,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:06:22,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:06:22,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:06:22,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:06:22,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:06:22,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:06:22,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:06:22,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:06:22,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:06:22,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:06:22,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:06:22,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:06:22,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:06:22,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:06:22,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:06:22,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:06:22,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:06:22,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:06:22,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:06:22,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:22,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:06:22,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:06:22,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:06:22,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:06:22,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:06:22,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:06:22,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:06:22,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:06:22,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:06:22,345 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-clean/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-clean/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 -> 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb [2024-10-11 05:06:22,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:06:22,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:06:22,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:06:22,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:06:22,646 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:06:22,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-10-11 05:06:24,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:06:24,480 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:06:24,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-10-11 05:06:24,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5505b69d/3927e46baeda485f863369b4c72ed522/FLAG11a6fa6a2 [2024-10-11 05:06:24,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5505b69d/3927e46baeda485f863369b4c72ed522 [2024-10-11 05:06:24,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:06:24,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:06:24,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:24,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:06:24,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:06:24,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:24" (1/1) ... [2024-10-11 05:06:24,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c13d4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:24, skipping insertion in model container [2024-10-11 05:06:24,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:24" (1/1) ... [2024-10-11 05:06:24,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:06:24,797 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_3.cil+token_ring.08.cil-1.c[911,924] [2024-10-11 05:06:24,881 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_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-10-11 05:06:24,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:25,001 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:06:25,013 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_3.cil+token_ring.08.cil-1.c[911,924] [2024-10-11 05:06:25,033 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_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-10-11 05:06:25,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:25,094 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:06:25,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25 WrapperNode [2024-10-11 05:06:25,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:25,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:25,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:06:25,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:06:25,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,145 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 866 [2024-10-11 05:06:25,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:25,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:06:25,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:06:25,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:06:25,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,221 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-11 05:06:25,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:06:25,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:06:25,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:06:25,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:06:25,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (1/1) ... [2024-10-11 05:06:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:25,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:06:25,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:06:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:06:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:06:25,373 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:06:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:06:25,374 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:06:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:06:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:06:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:06:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:06:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:06:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:06:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:06:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:06:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:06:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:06:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:06:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:06:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:06:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:06:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:06:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:06:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:06:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:06:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:06:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:06:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:06:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:06:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:06:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:06:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:06:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:06:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:06:25,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:06:25,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:06:26,167 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:06:26,169 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 05:06:26,359 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 05:06:26,362 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:06:26,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:06:26,429 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 05:06:26,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:26 BoogieIcfgContainer [2024-10-11 05:06:26,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:06:26,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:06:26,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:06:26,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:06:26,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:06:24" (1/3) ... [2024-10-11 05:06:26,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca44363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:26, skipping insertion in model container [2024-10-11 05:06:26,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:25" (2/3) ... [2024-10-11 05:06:26,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca44363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:26, skipping insertion in model container [2024-10-11 05:06:26,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:26" (3/3) ... [2024-10-11 05:06:26,442 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-10-11 05:06:26,458 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:06:26,459 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:06:26,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:06:26,564 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;@67aaa9bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:06:26,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:06:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 360 states, 305 states have (on average 1.698360655737705) internal successors, (518), 311 states have internal predecessors, (518), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 05:06:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:26,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:26,583 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] [2024-10-11 05:06:26,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -513258029, now seen corresponding path program 1 times [2024-10-11 05:06:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678572651] [2024-10-11 05:06:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,130 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-11 05:06:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678572651] [2024-10-11 05:06:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678572651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101256547] [2024-10-11 05:06:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:27,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:27,173 INFO L87 Difference]: Start difference. First operand has 360 states, 305 states have (on average 1.698360655737705) internal successors, (518), 311 states have internal predecessors, (518), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-11 05:06:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:28,432 INFO L93 Difference]: Finished difference Result 837 states and 1373 transitions. [2024-10-11 05:06:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2024-10-11 05:06:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:28,460 INFO L225 Difference]: With dead ends: 837 [2024-10-11 05:06:28,461 INFO L226 Difference]: Without dead ends: 493 [2024-10-11 05:06:28,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:28,520 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 986 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:28,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1429 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-11 05:06:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 456. [2024-10-11 05:06:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 387 states have internal predecessors, (597), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-10-11 05:06:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 702 transitions. [2024-10-11 05:06:28,654 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 702 transitions. Word has length 57 [2024-10-11 05:06:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 702 transitions. [2024-10-11 05:06:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-11 05:06:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 702 transitions. [2024-10-11 05:06:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:28,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:28,659 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] [2024-10-11 05:06:28,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:06:28,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1837716499, now seen corresponding path program 1 times [2024-10-11 05:06:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141224881] [2024-10-11 05:06:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,874 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-11 05:06:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:28,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141224881] [2024-10-11 05:06:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141224881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:28,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205583375] [2024-10-11 05:06:28,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:28,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:28,882 INFO L87 Difference]: Start difference. First operand 456 states and 702 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-11 05:06:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:30,173 INFO L93 Difference]: Finished difference Result 817 states and 1232 transitions. [2024-10-11 05:06:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:06:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2024-10-11 05:06:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:30,179 INFO L225 Difference]: With dead ends: 817 [2024-10-11 05:06:30,180 INFO L226 Difference]: Without dead ends: 629 [2024-10-11 05:06:30,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:06:30,183 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1086 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:30,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1728 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-11 05:06:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 557. [2024-10-11 05:06:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 468 states have internal predecessors, (712), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2024-10-11 05:06:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 851 transitions. [2024-10-11 05:06:30,260 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 851 transitions. Word has length 57 [2024-10-11 05:06:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:30,260 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 851 transitions. [2024-10-11 05:06:30,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-11 05:06:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 851 transitions. [2024-10-11 05:06:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:30,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:30,263 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] [2024-10-11 05:06:30,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:06:30,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:30,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1563764459, now seen corresponding path program 1 times [2024-10-11 05:06:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367068747] [2024-10-11 05:06:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,375 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-11 05:06:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367068747] [2024-10-11 05:06:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367068747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099119763] [2024-10-11 05:06:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:30,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:30,378 INFO L87 Difference]: Start difference. First operand 557 states and 851 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:31,390 INFO L93 Difference]: Finished difference Result 1163 states and 1727 transitions. [2024-10-11 05:06:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:06:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2024-10-11 05:06:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:31,396 INFO L225 Difference]: With dead ends: 1163 [2024-10-11 05:06:31,396 INFO L226 Difference]: Without dead ends: 880 [2024-10-11 05:06:31,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:06:31,399 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1172 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:31,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 1342 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-11 05:06:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 809. [2024-10-11 05:06:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 657 states have (on average 1.5068493150684932) internal successors, (990), 669 states have internal predecessors, (990), 94 states have call successors, (94), 49 states have call predecessors, (94), 56 states have return successors, (113), 94 states have call predecessors, (113), 92 states have call successors, (113) [2024-10-11 05:06:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1197 transitions. [2024-10-11 05:06:31,458 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1197 transitions. Word has length 57 [2024-10-11 05:06:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:31,459 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1197 transitions. [2024-10-11 05:06:31,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1197 transitions. [2024-10-11 05:06:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:06:31,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:31,461 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-11 05:06:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:06:31,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:31,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -101664118, now seen corresponding path program 1 times [2024-10-11 05:06:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864816144] [2024-10-11 05:06:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:06:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:06:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,649 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-11 05:06:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864816144] [2024-10-11 05:06:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864816144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512623969] [2024-10-11 05:06:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:31,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:31,652 INFO L87 Difference]: Start difference. First operand 809 states and 1197 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-11 05:06:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:32,830 INFO L93 Difference]: Finished difference Result 1411 states and 2058 transitions. [2024-10-11 05:06:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:32,830 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-11 05:06:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:32,836 INFO L225 Difference]: With dead ends: 1411 [2024-10-11 05:06:32,836 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 05:06:32,838 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-11 05:06:32,839 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 474 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:32,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1962 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 05:06:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 821. [2024-10-11 05:06:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 666 states have (on average 1.4954954954954955) internal successors, (996), 678 states have internal predecessors, (996), 94 states have call successors, (94), 49 states have call predecessors, (94), 59 states have return successors, (116), 97 states have call predecessors, (116), 92 states have call successors, (116) [2024-10-11 05:06:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1206 transitions. [2024-10-11 05:06:32,898 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1206 transitions. Word has length 58 [2024-10-11 05:06:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1206 transitions. [2024-10-11 05:06:32,898 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-11 05:06:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1206 transitions. [2024-10-11 05:06:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:06:32,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:32,900 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-11 05:06:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:06:32,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:32,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -174050676, now seen corresponding path program 1 times [2024-10-11 05:06:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369171700] [2024-10-11 05:06:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:06:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:06:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,170 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-11 05:06:33,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369171700] [2024-10-11 05:06:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369171700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:33,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369936351] [2024-10-11 05:06:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:33,174 INFO L87 Difference]: Start difference. First operand 821 states and 1206 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:35,278 INFO L93 Difference]: Finished difference Result 2820 states and 4121 transitions. [2024-10-11 05:06:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:06:35,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:06:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:35,287 INFO L225 Difference]: With dead ends: 2820 [2024-10-11 05:06:35,287 INFO L226 Difference]: Without dead ends: 1154 [2024-10-11 05:06:35,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 05:06:35,294 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 2289 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2306 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:35,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2306 Valid, 1671 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:06:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-10-11 05:06:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1024. [2024-10-11 05:06:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 813 states have (on average 1.4452644526445264) internal successors, (1175), 829 states have internal predecessors, (1175), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (165), 128 states have call predecessors, (165), 122 states have call successors, (165) [2024-10-11 05:06:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1464 transitions. [2024-10-11 05:06:35,368 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1464 transitions. Word has length 58 [2024-10-11 05:06:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:35,371 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1464 transitions. [2024-10-11 05:06:35,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1464 transitions. [2024-10-11 05:06:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:06:35,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:35,373 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-11 05:06:35,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:06:35,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:35,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1087440745, now seen corresponding path program 1 times [2024-10-11 05:06:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828909289] [2024-10-11 05:06:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,568 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-11 05:06:35,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828909289] [2024-10-11 05:06:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828909289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:35,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:35,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027458673] [2024-10-11 05:06:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:35,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:35,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:35,572 INFO L87 Difference]: Start difference. First operand 1024 states and 1464 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:36,667 INFO L93 Difference]: Finished difference Result 2116 states and 2996 transitions. [2024-10-11 05:06:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:06:36,668 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-10-11 05:06:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:36,671 INFO L225 Difference]: With dead ends: 2116 [2024-10-11 05:06:36,671 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 05:06:36,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:06:36,677 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1152 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:36,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1414 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:06:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 05:06:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-11 05:06:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.6150442477876106) internal successors, (365), 227 states have internal predecessors, (365), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 05:06:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 409 transitions. [2024-10-11 05:06:36,689 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 409 transitions. Word has length 59 [2024-10-11 05:06:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:36,689 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 409 transitions. [2024-10-11 05:06:36,690 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 409 transitions. [2024-10-11 05:06:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:36,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:36,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:36,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:06:36,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:36,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1301023663, now seen corresponding path program 1 times [2024-10-11 05:06:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930856746] [2024-10-11 05:06:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:36,830 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-11 05:06:36,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930856746] [2024-10-11 05:06:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930856746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:06:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839194843] [2024-10-11 05:06:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:06:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:06:36,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:06:36,833 INFO L87 Difference]: Start difference. First operand 255 states and 409 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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-11 05:06:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:37,792 INFO L93 Difference]: Finished difference Result 593 states and 968 transitions. [2024-10-11 05:06:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:06:37,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:37,795 INFO L225 Difference]: With dead ends: 593 [2024-10-11 05:06:37,795 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 05:06:37,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:37,796 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 691 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:37,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 458 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 05:06:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 255. [2024-10-11 05:06:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.6106194690265487) internal successors, (364), 227 states have internal predecessors, (364), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 05:06:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 408 transitions. [2024-10-11 05:06:37,809 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 408 transitions. Word has length 121 [2024-10-11 05:06:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:37,810 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 408 transitions. [2024-10-11 05:06:37,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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-11 05:06:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 408 transitions. [2024-10-11 05:06:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:37,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:37,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:06:37,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:37,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1266798671, now seen corresponding path program 1 times [2024-10-11 05:06:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830580337] [2024-10-11 05:06:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,953 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-11 05:06:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830580337] [2024-10-11 05:06:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830580337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:37,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:37,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204388488] [2024-10-11 05:06:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:37,956 INFO L87 Difference]: Start difference. First operand 255 states and 408 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-11 05:06:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:39,511 INFO L93 Difference]: Finished difference Result 926 states and 1518 transitions. [2024-10-11 05:06:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:39,516 INFO L225 Difference]: With dead ends: 926 [2024-10-11 05:06:39,517 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 05:06:39,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:06:39,519 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1041 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:39,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 771 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:06:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 05:06:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 507. [2024-10-11 05:06:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 454 states have (on average 1.6211453744493391) internal successors, (736), 456 states have internal predecessors, (736), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-11 05:06:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2024-10-11 05:06:39,550 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 121 [2024-10-11 05:06:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2024-10-11 05:06:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-11 05:06:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2024-10-11 05:06:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:39,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:39,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:39,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:06:39,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1812087183, now seen corresponding path program 1 times [2024-10-11 05:06:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951022633] [2024-10-11 05:06:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:39,768 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-11 05:06:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951022633] [2024-10-11 05:06:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951022633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66984971] [2024-10-11 05:06:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:39,773 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:42,406 INFO L93 Difference]: Finished difference Result 1531 states and 2508 transitions. [2024-10-11 05:06:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:42,413 INFO L225 Difference]: With dead ends: 1531 [2024-10-11 05:06:42,413 INFO L226 Difference]: Without dead ends: 1039 [2024-10-11 05:06:42,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:42,417 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 1060 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:42,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1456 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:06:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-11 05:06:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 740. [2024-10-11 05:06:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 663 states have (on average 1.6138763197586727) internal successors, (1070), 666 states have internal predecessors, (1070), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-11 05:06:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1187 transitions. [2024-10-11 05:06:42,474 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1187 transitions. Word has length 121 [2024-10-11 05:06:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:42,474 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1187 transitions. [2024-10-11 05:06:42,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1187 transitions. [2024-10-11 05:06:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:42,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:42,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:06:42,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash -221306863, now seen corresponding path program 1 times [2024-10-11 05:06:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747907675] [2024-10-11 05:06:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:42,712 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-11 05:06:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747907675] [2024-10-11 05:06:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747907675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:42,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642287253] [2024-10-11 05:06:42,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:42,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:42,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:42,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:42,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:42,715 INFO L87 Difference]: Start difference. First operand 740 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:45,102 INFO L93 Difference]: Finished difference Result 2417 states and 3950 transitions. [2024-10-11 05:06:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:45,109 INFO L225 Difference]: With dead ends: 2417 [2024-10-11 05:06:45,109 INFO L226 Difference]: Without dead ends: 1692 [2024-10-11 05:06:45,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:45,112 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1064 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:45,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1454 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:06:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2024-10-11 05:06:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1207. [2024-10-11 05:06:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1082 states have (on average 1.6072088724584104) internal successors, (1739), 1087 states have internal predecessors, (1739), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 05:06:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1932 transitions. [2024-10-11 05:06:45,224 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1932 transitions. Word has length 121 [2024-10-11 05:06:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:45,225 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1932 transitions. [2024-10-11 05:06:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1932 transitions. [2024-10-11 05:06:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:45,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:45,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:06:45,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2088015537, now seen corresponding path program 1 times [2024-10-11 05:06:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31314295] [2024-10-11 05:06:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:45,395 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-11 05:06:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31314295] [2024-10-11 05:06:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31314295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857502818] [2024-10-11 05:06:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:45,397 INFO L87 Difference]: Start difference. First operand 1207 states and 1932 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:47,821 INFO L93 Difference]: Finished difference Result 4113 states and 6699 transitions. [2024-10-11 05:06:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:47,839 INFO L225 Difference]: With dead ends: 4113 [2024-10-11 05:06:47,839 INFO L226 Difference]: Without dead ends: 2921 [2024-10-11 05:06:47,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:47,846 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1060 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:47,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1454 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:06:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2024-10-11 05:06:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2147. [2024-10-11 05:06:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1926 states have (on average 1.602803738317757) internal successors, (3087), 1935 states have internal predecessors, (3087), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 05:06:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3438 transitions. [2024-10-11 05:06:48,037 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3438 transitions. Word has length 121 [2024-10-11 05:06:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:48,037 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3438 transitions. [2024-10-11 05:06:48,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3438 transitions. [2024-10-11 05:06:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:48,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:48,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:48,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:06:48,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:48,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash -190518771, now seen corresponding path program 1 times [2024-10-11 05:06:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:48,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61652532] [2024-10-11 05:06:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:48,231 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-11 05:06:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61652532] [2024-10-11 05:06:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61652532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:48,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855584524] [2024-10-11 05:06:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:48,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:48,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:48,233 INFO L87 Difference]: Start difference. First operand 2147 states and 3438 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:51,078 INFO L93 Difference]: Finished difference Result 7515 states and 12231 transitions. [2024-10-11 05:06:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:51,114 INFO L225 Difference]: With dead ends: 7515 [2024-10-11 05:06:51,118 INFO L226 Difference]: Without dead ends: 5383 [2024-10-11 05:06:51,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:51,128 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1134 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:51,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 956 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:06:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5383 states. [2024-10-11 05:06:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5383 to 4032. [2024-10-11 05:06:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 3619 states have (on average 1.5996131528046422) internal successors, (5789), 3636 states have internal predecessors, (5789), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-11 05:06:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 6474 transitions. [2024-10-11 05:06:51,573 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 6474 transitions. Word has length 121 [2024-10-11 05:06:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:51,574 INFO L471 AbstractCegarLoop]: Abstraction has 4032 states and 6474 transitions. [2024-10-11 05:06:51,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 6474 transitions. [2024-10-11 05:06:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:51,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:06:51,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:06:51,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 840522127, now seen corresponding path program 1 times [2024-10-11 05:06:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524987633] [2024-10-11 05:06:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:51,874 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-11 05:06:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524987633] [2024-10-11 05:06:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524987633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:51,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:51,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449232135] [2024-10-11 05:06:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:51,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:51,877 INFO L87 Difference]: Start difference. First operand 4032 states and 6474 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:55,060 INFO L93 Difference]: Finished difference Result 14318 states and 23353 transitions. [2024-10-11 05:06:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:55,122 INFO L225 Difference]: With dead ends: 14318 [2024-10-11 05:06:55,123 INFO L226 Difference]: Without dead ends: 10301 [2024-10-11 05:06:55,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:55,143 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1058 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:55,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1454 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:06:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10301 states. [2024-10-11 05:06:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10301 to 7817. [2024-10-11 05:06:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7817 states, 7020 states have (on average 1.5975783475783476) internal successors, (11215), 7053 states have internal predecessors, (11215), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-10-11 05:06:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 12622 transitions. [2024-10-11 05:06:55,840 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 12622 transitions. Word has length 121 [2024-10-11 05:06:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:55,840 INFO L471 AbstractCegarLoop]: Abstraction has 7817 states and 12622 transitions. [2024-10-11 05:06:55,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 12622 transitions. [2024-10-11 05:06:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:55,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:55,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:06:55,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1065881139, now seen corresponding path program 1 times [2024-10-11 05:06:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832342133] [2024-10-11 05:06:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:06:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832342133] [2024-10-11 05:06:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832342133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470486405] [2024-10-11 05:06:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:56,060 INFO L87 Difference]: Start difference. First operand 7817 states and 12622 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:06:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:59,461 INFO L93 Difference]: Finished difference Result 27925 states and 45791 transitions. [2024-10-11 05:06:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:06:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:59,539 INFO L225 Difference]: With dead ends: 27925 [2024-10-11 05:06:59,539 INFO L226 Difference]: Without dead ends: 20123 [2024-10-11 05:06:59,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:59,564 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1057 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:59,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1454 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:06:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20123 states. [2024-10-11 05:07:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20123 to 15418. [2024-10-11 05:07:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15418 states, 13853 states have (on average 1.5962607377463365) internal successors, (22113), 13918 states have internal predecessors, (22113), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 454 states have return successors, (1903), 1173 states have call predecessors, (1903), 1110 states have call successors, (1903) [2024-10-11 05:07:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15418 states to 15418 states and 25126 transitions. [2024-10-11 05:07:00,795 INFO L78 Accepts]: Start accepts. Automaton has 15418 states and 25126 transitions. Word has length 121 [2024-10-11 05:07:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 15418 states and 25126 transitions. [2024-10-11 05:07:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:07:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15418 states and 25126 transitions. [2024-10-11 05:07:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:07:00,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:00,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:00,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:07:00,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:00,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 535189967, now seen corresponding path program 1 times [2024-10-11 05:07:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012750805] [2024-10-11 05:07:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:07:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:07:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:07:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,942 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-11 05:07:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012750805] [2024-10-11 05:07:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012750805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474494406] [2024-10-11 05:07:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:00,944 INFO L87 Difference]: Start difference. First operand 15418 states and 25126 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:07:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:05,612 INFO L93 Difference]: Finished difference Result 55140 states and 91269 transitions. [2024-10-11 05:07:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:07:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:05,813 INFO L225 Difference]: With dead ends: 55140 [2024-10-11 05:07:05,813 INFO L226 Difference]: Without dead ends: 39737 [2024-10-11 05:07:05,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:05,893 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1056 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:05,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1454 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:07:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39737 states. [2024-10-11 05:07:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39737 to 30683. [2024-10-11 05:07:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30683 states, 27582 states have (on average 1.595352041186281) internal successors, (44003), 27711 states have internal predecessors, (44003), 2198 states have call successors, (2198), 774 states have call predecessors, (2198), 902 states have return successors, (4513), 2325 states have call predecessors, (4513), 2198 states have call successors, (4513) [2024-10-11 05:07:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30683 states to 30683 states and 50714 transitions. [2024-10-11 05:07:08,727 INFO L78 Accepts]: Start accepts. Automaton has 30683 states and 50714 transitions. Word has length 121 [2024-10-11 05:07:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 30683 states and 50714 transitions. [2024-10-11 05:07:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:07:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30683 states and 50714 transitions. [2024-10-11 05:07:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:07:08,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:08,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:07:08,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -521541235, now seen corresponding path program 1 times [2024-10-11 05:07:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691203057] [2024-10-11 05:07:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:07:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:07:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:07:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,949 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-11 05:07:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691203057] [2024-10-11 05:07:09,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691203057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:09,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:09,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974499450] [2024-10-11 05:07:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:09,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:09,126 INFO L87 Difference]: Start difference. First operand 30683 states and 50714 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:07:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:19,816 INFO L93 Difference]: Finished difference Result 122883 states and 205453 transitions. [2024-10-11 05:07:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:07:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 05:07:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:20,502 INFO L225 Difference]: With dead ends: 122883 [2024-10-11 05:07:20,506 INFO L226 Difference]: Without dead ends: 92215 [2024-10-11 05:07:20,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:07:20,717 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1129 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:20,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1447 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 05:07:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92215 states. [2024-10-11 05:07:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92215 to 61084. [2024-10-11 05:07:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61084 states, 55039 states have (on average 1.5960500735841858) internal successors, (87845), 55296 states have internal predecessors, (87845), 4246 states have call successors, (4246), 1542 states have call predecessors, (4246), 1798 states have return successors, (11063), 4501 states have call predecessors, (11063), 4246 states have call successors, (11063) [2024-10-11 05:07:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61084 states to 61084 states and 103154 transitions. [2024-10-11 05:07:26,022 INFO L78 Accepts]: Start accepts. Automaton has 61084 states and 103154 transitions. Word has length 121 [2024-10-11 05:07:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:26,024 INFO L471 AbstractCegarLoop]: Abstraction has 61084 states and 103154 transitions. [2024-10-11 05:07:26,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-11 05:07:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61084 states and 103154 transitions. [2024-10-11 05:07:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:07:26,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:26,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:26,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:07:26,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:26,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:26,055 INFO L85 PathProgramCache]: Analyzing trace with hash 829843983, now seen corresponding path program 1 times [2024-10-11 05:07:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:26,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915849921] [2024-10-11 05:07:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:07:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:07:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:07:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,198 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-11 05:07:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915849921] [2024-10-11 05:07:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915849921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:26,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392506281] [2024-10-11 05:07:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:26,200 INFO L87 Difference]: Start difference. First operand 61084 states and 103154 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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)