./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:01:47,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:01:47,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 03:01:47,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:01:47,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:01:47,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:01:47,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:01:47,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:01:47,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:01:47,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:01:47,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:01:47,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:01:47,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:01:47,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:01:47,373 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:01:47,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:01:47,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:01:47,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 03:01:47,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:01:47,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 03:01:47,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:01:47,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:01:47,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:01:47,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:01:47,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:01:47,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 03:01:47,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:01:47,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:01:47,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:01:47,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:01:47,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:01:47,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:01:47,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:01:47,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:01:47,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:01:47,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:01:47,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:01:47,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:01:47,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:01:47,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:01:47,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:01:47,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:01:47,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 [2024-10-24 03:01:47,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:01:47,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:01:47,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:01:47,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:01:47,713 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:01:47,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2024-10-24 03:01:49,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:01:49,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:01:49,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2024-10-24 03:01:49,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bbbfa90/45d21cb533a740dd821452cf3aabc73e/FLAG751b7fc7d [2024-10-24 03:01:49,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bbbfa90/45d21cb533a740dd821452cf3aabc73e [2024-10-24 03:01:49,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:01:49,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:01:49,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:01:49,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:01:49,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:01:49,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79670e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49, skipping insertion in model container [2024-10-24 03:01:49,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:01:49,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2024-10-24 03:01:49,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2024-10-24 03:01:49,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:01:49,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:01:49,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2024-10-24 03:01:49,850 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2024-10-24 03:01:49,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:01:49,905 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:01:49,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49 WrapperNode [2024-10-24 03:01:49,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:01:49,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:01:49,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:01:49,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:01:49,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,956 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 534 [2024-10-24 03:01:49,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:01:49,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:01:49,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:01:49,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:01:49,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,996 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-24 03:01:49,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:49,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:01:50,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:01:50,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:01:50,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:01:50,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (1/1) ... [2024-10-24 03:01:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:01:50,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:01:50,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 03:01:50,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 03:01:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:01:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 03:01:50,138 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 03:01:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-24 03:01:50,140 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-24 03:01:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 03:01:50,141 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 03:01:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 03:01:50,141 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 03:01:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-24 03:01:50,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-24 03:01:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 03:01:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 03:01:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 03:01:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 03:01:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-24 03:01:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-24 03:01:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-24 03:01:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-24 03:01:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-24 03:01:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-24 03:01:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 03:01:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 03:01:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:01:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 03:01:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 03:01:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-24 03:01:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-24 03:01:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:01:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:01:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 03:01:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 03:01:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-24 03:01:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-24 03:01:50,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:01:50,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:01:50,963 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-24 03:01:50,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:01:51,023 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:01:51,025 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-24 03:01:51,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:01:51 BoogieIcfgContainer [2024-10-24 03:01:51,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:01:51,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:01:51,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:01:51,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:01:51,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:01:49" (1/3) ... [2024-10-24 03:01:51,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c159aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:01:51, skipping insertion in model container [2024-10-24 03:01:51,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:49" (2/3) ... [2024-10-24 03:01:51,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c159aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:01:51, skipping insertion in model container [2024-10-24 03:01:51,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:01:51" (3/3) ... [2024-10-24 03:01:51,037 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2024-10-24 03:01:51,057 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:01:51,058 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 03:01:51,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:01:51,151 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;@e793c8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:01:51,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 03:01:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 189 states have (on average 1.6613756613756614) internal successors, (314), 197 states have internal predecessors, (314), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 03:01:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:51,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:51,168 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-24 03:01:51,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1742543398, now seen corresponding path program 1 times [2024-10-24 03:01:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565690092] [2024-10-24 03:01:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:51,873 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-24 03:01:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565690092] [2024-10-24 03:01:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565690092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:51,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287924892] [2024-10-24 03:01:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:51,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:51,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:51,908 INFO L87 Difference]: Start difference. First operand has 240 states, 189 states have (on average 1.6613756613756614) internal successors, (314), 197 states have internal predecessors, (314), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:53,126 INFO L93 Difference]: Finished difference Result 588 states and 929 transitions. [2024-10-24 03:01:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-24 03:01:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:53,147 INFO L225 Difference]: With dead ends: 588 [2024-10-24 03:01:53,148 INFO L226 Difference]: Without dead ends: 359 [2024-10-24 03:01:53,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:01:53,158 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 466 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:53,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 931 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 03:01:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-24 03:01:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2024-10-24 03:01:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 261 states have internal predecessors, (384), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2024-10-24 03:01:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2024-10-24 03:01:53,241 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 58 [2024-10-24 03:01:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:53,242 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2024-10-24 03:01:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2024-10-24 03:01:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:53,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:53,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:53,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:01:53,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:53,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1876777062, now seen corresponding path program 1 times [2024-10-24 03:01:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814105250] [2024-10-24 03:01:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:53,470 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-24 03:01:53,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814105250] [2024-10-24 03:01:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814105250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925140206] [2024-10-24 03:01:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:53,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:53,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:53,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:53,475 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:54,541 INFO L93 Difference]: Finished difference Result 642 states and 923 transitions. [2024-10-24 03:01:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:01:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-24 03:01:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:54,552 INFO L225 Difference]: With dead ends: 642 [2024-10-24 03:01:54,552 INFO L226 Difference]: Without dead ends: 480 [2024-10-24 03:01:54,556 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-24 03:01:54,558 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 824 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:54,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 991 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:01:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-24 03:01:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 410. [2024-10-24 03:01:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 322 states have (on average 1.4906832298136645) internal successors, (480), 331 states have internal predecessors, (480), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2024-10-24 03:01:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2024-10-24 03:01:54,634 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 58 [2024-10-24 03:01:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:54,635 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2024-10-24 03:01:54,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2024-10-24 03:01:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:54,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:54,639 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-24 03:01:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:01:54,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 51495640, now seen corresponding path program 1 times [2024-10-24 03:01:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631611053] [2024-10-24 03:01:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:54,807 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-24 03:01:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631611053] [2024-10-24 03:01:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631611053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:01:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601250796] [2024-10-24 03:01:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:01:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:01:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:01:54,810 INFO L87 Difference]: Start difference. First operand 410 states and 599 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-24 03:01:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:55,619 INFO L93 Difference]: Finished difference Result 684 states and 985 transitions. [2024-10-24 03:01:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:55,620 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-24 03:01:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:55,623 INFO L225 Difference]: With dead ends: 684 [2024-10-24 03:01:55,623 INFO L226 Difference]: Without dead ends: 440 [2024-10-24 03:01:55,624 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-24 03:01:55,625 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 400 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:55,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1149 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:01:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-24 03:01:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 414. [2024-10-24 03:01:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 325 states have (on average 1.48) internal successors, (481), 334 states have internal predecessors, (481), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2024-10-24 03:01:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 601 transitions. [2024-10-24 03:01:55,679 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 601 transitions. Word has length 58 [2024-10-24 03:01:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:55,679 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 601 transitions. [2024-10-24 03:01:55,680 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-24 03:01:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 601 transitions. [2024-10-24 03:01:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:55,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:55,686 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-24 03:01:55,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:01:55,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2102479638, now seen corresponding path program 1 times [2024-10-24 03:01:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228755573] [2024-10-24 03:01:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228755573] [2024-10-24 03:01:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228755573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:55,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:01:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563086352] [2024-10-24 03:01:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:01:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:01:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:01:55,844 INFO L87 Difference]: Start difference. First operand 414 states and 601 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-24 03:01:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:56,667 INFO L93 Difference]: Finished difference Result 702 states and 1003 transitions. [2024-10-24 03:01:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:01:56,668 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-24 03:01:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:56,673 INFO L225 Difference]: With dead ends: 702 [2024-10-24 03:01:56,674 INFO L226 Difference]: Without dead ends: 454 [2024-10-24 03:01:56,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:01:56,678 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 406 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:56,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1148 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:01:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-24 03:01:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 426. [2024-10-24 03:01:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 334 states have (on average 1.467065868263473) internal successors, (490), 343 states have internal predecessors, (490), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-24 03:01:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 613 transitions. [2024-10-24 03:01:56,736 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 613 transitions. Word has length 58 [2024-10-24 03:01:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:56,736 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 613 transitions. [2024-10-24 03:01:56,736 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-24 03:01:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 613 transitions. [2024-10-24 03:01:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:56,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:56,738 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-24 03:01:56,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:01:56,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2130448044, now seen corresponding path program 1 times [2024-10-24 03:01:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264239086] [2024-10-24 03:01:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,918 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-24 03:01:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264239086] [2024-10-24 03:01:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264239086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:01:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131338803] [2024-10-24 03:01:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:56,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:01:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:01:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:56,921 INFO L87 Difference]: Start difference. First operand 426 states and 613 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:57,917 INFO L93 Difference]: Finished difference Result 782 states and 1088 transitions. [2024-10-24 03:01:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:01:57,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-24 03:01:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:57,922 INFO L225 Difference]: With dead ends: 782 [2024-10-24 03:01:57,922 INFO L226 Difference]: Without dead ends: 524 [2024-10-24 03:01:57,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-24 03:01:57,924 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 682 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:57,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 968 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:01:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-24 03:01:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 436. [2024-10-24 03:01:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 342 states have (on average 1.456140350877193) internal successors, (498), 351 states have internal predecessors, (498), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2024-10-24 03:01:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 621 transitions. [2024-10-24 03:01:57,969 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 621 transitions. Word has length 58 [2024-10-24 03:01:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 621 transitions. [2024-10-24 03:01:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 621 transitions. [2024-10-24 03:01:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 03:01:57,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:57,972 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-24 03:01:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:01:57,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:57,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1707746218, now seen corresponding path program 1 times [2024-10-24 03:01:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609747510] [2024-10-24 03:01:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,092 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-24 03:01:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609747510] [2024-10-24 03:01:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609747510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10673444] [2024-10-24 03:01:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:58,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:58,095 INFO L87 Difference]: Start difference. First operand 436 states and 621 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:58,709 INFO L93 Difference]: Finished difference Result 1018 states and 1408 transitions. [2024-10-24 03:01:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:01:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-24 03:01:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:58,715 INFO L225 Difference]: With dead ends: 1018 [2024-10-24 03:01:58,715 INFO L226 Difference]: Without dead ends: 751 [2024-10-24 03:01:58,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:01:58,717 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 655 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:58,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 775 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:01:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-24 03:01:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2024-10-24 03:01:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 537 states have (on average 1.4078212290502794) internal successors, (756), 553 states have internal predecessors, (756), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2024-10-24 03:01:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 971 transitions. [2024-10-24 03:01:58,793 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 971 transitions. Word has length 58 [2024-10-24 03:01:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 971 transitions. [2024-10-24 03:01:58,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 03:01:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 971 transitions. [2024-10-24 03:01:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 03:01:58,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:58,802 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-24 03:01:58,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 03:01:58,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 145569187, now seen corresponding path program 1 times [2024-10-24 03:01:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457635167] [2024-10-24 03:01:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:58,912 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-24 03:01:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457635167] [2024-10-24 03:01:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457635167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553098747] [2024-10-24 03:01:58,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:58,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:58,914 INFO L87 Difference]: Start difference. First operand 697 states and 971 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:01:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:59,534 INFO L93 Difference]: Finished difference Result 1781 states and 2417 transitions. [2024-10-24 03:01:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 03:01:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-24 03:01:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:59,543 INFO L225 Difference]: With dead ends: 1781 [2024-10-24 03:01:59,543 INFO L226 Difference]: Without dead ends: 1262 [2024-10-24 03:01:59,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:01:59,546 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 657 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:59,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 669 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:01:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-10-24 03:01:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1108. [2024-10-24 03:01:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 848 states have (on average 1.3632075471698113) internal successors, (1156), 871 states have internal predecessors, (1156), 140 states have call successors, (140), 94 states have call predecessors, (140), 118 states have return successors, (194), 149 states have call predecessors, (194), 136 states have call successors, (194) [2024-10-24 03:01:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1490 transitions. [2024-10-24 03:01:59,654 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1490 transitions. Word has length 59 [2024-10-24 03:01:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:59,656 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1490 transitions. [2024-10-24 03:01:59,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:01:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1490 transitions. [2024-10-24 03:01:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 03:01:59,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:59,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, 1, 1, 1] [2024-10-24 03:01:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 03:01:59,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1649370768, now seen corresponding path program 1 times [2024-10-24 03:01:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135324151] [2024-10-24 03:01:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:01:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:01:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:01:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:01:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:01:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:01:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:59,741 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-24 03:01:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135324151] [2024-10-24 03:01:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135324151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328796276] [2024-10-24 03:01:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:59,744 INFO L87 Difference]: Start difference. First operand 1108 states and 1490 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:00,479 INFO L93 Difference]: Finished difference Result 3068 states and 4053 transitions. [2024-10-24 03:02:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:02:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-24 03:02:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:00,490 INFO L225 Difference]: With dead ends: 3068 [2024-10-24 03:02:00,490 INFO L226 Difference]: Without dead ends: 2108 [2024-10-24 03:02:00,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:02:00,494 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 452 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:00,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 747 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:02:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-10-24 03:02:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1924. [2024-10-24 03:02:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1466 states have (on average 1.3287858117326057) internal successors, (1948), 1495 states have internal predecessors, (1948), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2024-10-24 03:02:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2514 transitions. [2024-10-24 03:02:00,688 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2514 transitions. Word has length 60 [2024-10-24 03:02:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:00,688 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2514 transitions. [2024-10-24 03:02:00,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2514 transitions. [2024-10-24 03:02:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 03:02:00,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:00,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:00,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 03:02:00,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1412472623, now seen corresponding path program 1 times [2024-10-24 03:02:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231039370] [2024-10-24 03:02:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:00,792 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-24 03:02:00,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:00,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231039370] [2024-10-24 03:02:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231039370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489204133] [2024-10-24 03:02:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:00,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:00,797 INFO L87 Difference]: Start difference. First operand 1924 states and 2514 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:01,557 INFO L93 Difference]: Finished difference Result 4588 states and 5918 transitions. [2024-10-24 03:02:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:02:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-24 03:02:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:01,574 INFO L225 Difference]: With dead ends: 4588 [2024-10-24 03:02:01,574 INFO L226 Difference]: Without dead ends: 2832 [2024-10-24 03:02:01,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:02:01,583 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 645 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:01,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 681 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:02:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-10-24 03:02:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2590. [2024-10-24 03:02:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 1968 states have (on average 1.3140243902439024) internal successors, (2586), 2005 states have internal predecessors, (2586), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2024-10-24 03:02:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3341 transitions. [2024-10-24 03:02:01,825 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3341 transitions. Word has length 66 [2024-10-24 03:02:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 3341 transitions. [2024-10-24 03:02:01,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3341 transitions. [2024-10-24 03:02:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 03:02:01,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:01,832 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 03:02:01,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 320677339, now seen corresponding path program 1 times [2024-10-24 03:02:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560826112] [2024-10-24 03:02:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:02:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560826112] [2024-10-24 03:02:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560826112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947105012] [2024-10-24 03:02:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:01,927 INFO L87 Difference]: Start difference. First operand 2590 states and 3341 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 03:02:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:02,815 INFO L93 Difference]: Finished difference Result 3310 states and 4218 transitions. [2024-10-24 03:02:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 03:02:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-24 03:02:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:02,835 INFO L225 Difference]: With dead ends: 3310 [2024-10-24 03:02:02,835 INFO L226 Difference]: Without dead ends: 3307 [2024-10-24 03:02:02,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:02:02,839 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 992 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:02,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 655 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:02:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2024-10-24 03:02:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3040. [2024-10-24 03:02:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 2309 states have (on average 1.3053269813772195) internal successors, (3014), 2351 states have internal predecessors, (3014), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2024-10-24 03:02:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3898 transitions. [2024-10-24 03:02:03,210 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3898 transitions. Word has length 67 [2024-10-24 03:02:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:03,210 INFO L471 AbstractCegarLoop]: Abstraction has 3040 states and 3898 transitions. [2024-10-24 03:02:03,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 03:02:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3898 transitions. [2024-10-24 03:02:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 03:02:03,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:03,213 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:03,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 03:02:03,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1350257913, now seen corresponding path program 1 times [2024-10-24 03:02:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634446309] [2024-10-24 03:02:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:02:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:03,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634446309] [2024-10-24 03:02:03,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634446309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:03,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862162640] [2024-10-24 03:02:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:03,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:02:03,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 03:02:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:03,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 03:02:03,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:02:03,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:02:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:02:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862162640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:02:03,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:02:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-24 03:02:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407880554] [2024-10-24 03:02:03,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:02:03,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 03:02:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 03:02:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:02:03,891 INFO L87 Difference]: Start difference. First operand 3040 states and 3898 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 03:02:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:05,929 INFO L93 Difference]: Finished difference Result 7107 states and 9010 transitions. [2024-10-24 03:02:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 03:02:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-24 03:02:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:05,969 INFO L225 Difference]: With dead ends: 7107 [2024-10-24 03:02:05,970 INFO L226 Difference]: Without dead ends: 7104 [2024-10-24 03:02:05,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-24 03:02:05,976 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1265 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:05,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1287 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 03:02:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2024-10-24 03:02:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 4666. [2024-10-24 03:02:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4666 states, 3549 states have (on average 1.3034657650042265) internal successors, (4626), 3613 states have internal predecessors, (4626), 548 states have call successors, (548), 452 states have call predecessors, (548), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2024-10-24 03:02:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 5972 transitions. [2024-10-24 03:02:06,629 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 5972 transitions. Word has length 68 [2024-10-24 03:02:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 4666 states and 5972 transitions. [2024-10-24 03:02:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 03:02:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 5972 transitions. [2024-10-24 03:02:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 03:02:06,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:06,633 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:06,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 03:02:06,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 03:02:06,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2127874085, now seen corresponding path program 2 times [2024-10-24 03:02:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946371226] [2024-10-24 03:02:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:02:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946371226] [2024-10-24 03:02:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946371226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:06,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415057560] [2024-10-24 03:02:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:06,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:06,906 INFO L87 Difference]: Start difference. First operand 4666 states and 5972 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 03:02:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:07,760 INFO L93 Difference]: Finished difference Result 7122 states and 9119 transitions. [2024-10-24 03:02:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:02:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-24 03:02:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:07,781 INFO L225 Difference]: With dead ends: 7122 [2024-10-24 03:02:07,781 INFO L226 Difference]: Without dead ends: 3419 [2024-10-24 03:02:07,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:02:07,790 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 572 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:07,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 750 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:02:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-10-24 03:02:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3190. [2024-10-24 03:02:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 2429 states have (on average 1.283655825442569) internal successors, (3118), 2471 states have internal predecessors, (3118), 380 states have call successors, (380), 308 states have call predecessors, (380), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2024-10-24 03:02:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4022 transitions. [2024-10-24 03:02:08,131 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4022 transitions. Word has length 71 [2024-10-24 03:02:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 3190 states and 4022 transitions. [2024-10-24 03:02:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 03:02:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4022 transitions. [2024-10-24 03:02:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:08,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:08,135 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] [2024-10-24 03:02:08,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 03:02:08,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:08,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash 357099915, now seen corresponding path program 1 times [2024-10-24 03:02:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471344898] [2024-10-24 03:02:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:08,237 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-24 03:02:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471344898] [2024-10-24 03:02:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471344898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813237584] [2024-10-24 03:02:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:08,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:08,239 INFO L87 Difference]: Start difference. First operand 3190 states and 4022 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:09,629 INFO L93 Difference]: Finished difference Result 3545 states and 4586 transitions. [2024-10-24 03:02:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:02:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:09,654 INFO L225 Difference]: With dead ends: 3545 [2024-10-24 03:02:09,654 INFO L226 Difference]: Without dead ends: 3408 [2024-10-24 03:02:09,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:02:09,658 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 714 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:09,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 710 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:02:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2024-10-24 03:02:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3327. [2024-10-24 03:02:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 2547 states have (on average 1.2976050255202198) internal successors, (3305), 2590 states have internal predecessors, (3305), 392 states have call successors, (392), 314 states have call predecessors, (392), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2024-10-24 03:02:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 4236 transitions. [2024-10-24 03:02:10,060 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 4236 transitions. Word has length 72 [2024-10-24 03:02:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:10,060 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 4236 transitions. [2024-10-24 03:02:10,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 4236 transitions. [2024-10-24 03:02:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:10,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:10,064 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] [2024-10-24 03:02:10,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:02:10,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:10,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash 620963463, now seen corresponding path program 1 times [2024-10-24 03:02:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:10,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454498214] [2024-10-24 03:02:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:10,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:10,188 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-24 03:02:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454498214] [2024-10-24 03:02:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454498214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119421735] [2024-10-24 03:02:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:10,191 INFO L87 Difference]: Start difference. First operand 3327 states and 4236 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:11,601 INFO L93 Difference]: Finished difference Result 3860 states and 5076 transitions. [2024-10-24 03:02:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:02:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:11,616 INFO L225 Difference]: With dead ends: 3860 [2024-10-24 03:02:11,616 INFO L226 Difference]: Without dead ends: 3586 [2024-10-24 03:02:11,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:02:11,619 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 711 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:11,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1126 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 03:02:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2024-10-24 03:02:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3455. [2024-10-24 03:02:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3455 states, 2656 states have (on average 1.3079819277108433) internal successors, (3474), 2700 states have internal predecessors, (3474), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2024-10-24 03:02:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4431 transitions. [2024-10-24 03:02:12,008 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4431 transitions. Word has length 72 [2024-10-24 03:02:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:12,008 INFO L471 AbstractCegarLoop]: Abstraction has 3455 states and 4431 transitions. [2024-10-24 03:02:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4431 transitions. [2024-10-24 03:02:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:12,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:12,011 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] [2024-10-24 03:02:12,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:02:12,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:12,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1181663241, now seen corresponding path program 1 times [2024-10-24 03:02:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526178224] [2024-10-24 03:02:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:12,120 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-24 03:02:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526178224] [2024-10-24 03:02:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526178224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:12,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975167346] [2024-10-24 03:02:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:12,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:12,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:12,122 INFO L87 Difference]: Start difference. First operand 3455 states and 4431 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:13,764 INFO L93 Difference]: Finished difference Result 4321 states and 5793 transitions. [2024-10-24 03:02:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:02:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:13,782 INFO L225 Difference]: With dead ends: 4321 [2024-10-24 03:02:13,782 INFO L226 Difference]: Without dead ends: 3919 [2024-10-24 03:02:13,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:02:13,793 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 709 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:13,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1124 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 03:02:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-24 03:02:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3712. [2024-10-24 03:02:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 2875 states have (on average 1.3262608695652174) internal successors, (3813), 2921 states have internal predecessors, (3813), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-24 03:02:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4826 transitions. [2024-10-24 03:02:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4826 transitions. Word has length 72 [2024-10-24 03:02:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:14,245 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4826 transitions. [2024-10-24 03:02:14,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4826 transitions. [2024-10-24 03:02:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:14,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:14,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 03:02:14,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:14,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1615392327, now seen corresponding path program 1 times [2024-10-24 03:02:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138260261] [2024-10-24 03:02:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:14,373 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-24 03:02:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138260261] [2024-10-24 03:02:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138260261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624907287] [2024-10-24 03:02:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:14,376 INFO L87 Difference]: Start difference. First operand 3712 states and 4826 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:15,463 INFO L93 Difference]: Finished difference Result 4566 states and 6179 transitions. [2024-10-24 03:02:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:02:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:15,478 INFO L225 Difference]: With dead ends: 4566 [2024-10-24 03:02:15,478 INFO L226 Difference]: Without dead ends: 3907 [2024-10-24 03:02:15,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:02:15,482 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 693 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:15,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 557 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:02:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2024-10-24 03:02:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3712. [2024-10-24 03:02:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 2875 states have (on average 1.3245217391304347) internal successors, (3808), 2921 states have internal predecessors, (3808), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-24 03:02:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4821 transitions. [2024-10-24 03:02:15,983 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4821 transitions. Word has length 72 [2024-10-24 03:02:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4821 transitions. [2024-10-24 03:02:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4821 transitions. [2024-10-24 03:02:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:15,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:15,987 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] [2024-10-24 03:02:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 03:02:15,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:15,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1418657719, now seen corresponding path program 1 times [2024-10-24 03:02:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593752854] [2024-10-24 03:02:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:16,104 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-24 03:02:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593752854] [2024-10-24 03:02:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593752854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364702804] [2024-10-24 03:02:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:16,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:16,107 INFO L87 Difference]: Start difference. First operand 3712 states and 4821 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:17,937 INFO L93 Difference]: Finished difference Result 5379 states and 7410 transitions. [2024-10-24 03:02:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:02:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:17,956 INFO L225 Difference]: With dead ends: 5379 [2024-10-24 03:02:17,956 INFO L226 Difference]: Without dead ends: 4720 [2024-10-24 03:02:17,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:02:17,962 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 726 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:17,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1117 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 03:02:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2024-10-24 03:02:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 4223. [2024-10-24 03:02:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 3314 states have (on average 1.352745926372963) internal successors, (4483), 3364 states have internal predecessors, (4483), 472 states have call successors, (472), 356 states have call predecessors, (472), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-10-24 03:02:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 5606 transitions. [2024-10-24 03:02:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 5606 transitions. Word has length 72 [2024-10-24 03:02:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:18,542 INFO L471 AbstractCegarLoop]: Abstraction has 4223 states and 5606 transitions. [2024-10-24 03:02:18,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 5606 transitions. [2024-10-24 03:02:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:18,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:18,547 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] [2024-10-24 03:02:18,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 03:02:18,547 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:18,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1377982969, now seen corresponding path program 1 times [2024-10-24 03:02:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378000272] [2024-10-24 03:02:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:18,673 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-24 03:02:18,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:18,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378000272] [2024-10-24 03:02:18,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378000272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:18,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:18,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724370455] [2024-10-24 03:02:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:18,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:18,676 INFO L87 Difference]: Start difference. First operand 4223 states and 5606 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:20,243 INFO L93 Difference]: Finished difference Result 7220 states and 10259 transitions. [2024-10-24 03:02:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:02:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:20,262 INFO L225 Difference]: With dead ends: 7220 [2024-10-24 03:02:20,262 INFO L226 Difference]: Without dead ends: 6050 [2024-10-24 03:02:20,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:02:20,267 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 782 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:20,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1113 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:02:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2024-10-24 03:02:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 5161. [2024-10-24 03:02:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5161 states, 4112 states have (on average 1.383511673151751) internal successors, (5689), 4170 states have internal predecessors, (5689), 556 states have call successors, (556), 404 states have call predecessors, (556), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2024-10-24 03:02:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 7042 transitions. [2024-10-24 03:02:20,861 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 7042 transitions. Word has length 72 [2024-10-24 03:02:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 5161 states and 7042 transitions. [2024-10-24 03:02:20,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 7042 transitions. [2024-10-24 03:02:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:20,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:20,866 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] [2024-10-24 03:02:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 03:02:20,867 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash 8802441, now seen corresponding path program 1 times [2024-10-24 03:02:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845807687] [2024-10-24 03:02:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:21,006 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-24 03:02:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845807687] [2024-10-24 03:02:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845807687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163670192] [2024-10-24 03:02:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:21,009 INFO L87 Difference]: Start difference. First operand 5161 states and 7042 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:23,036 INFO L93 Difference]: Finished difference Result 10340 states and 15067 transitions. [2024-10-24 03:02:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:02:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:23,068 INFO L225 Difference]: With dead ends: 10340 [2024-10-24 03:02:23,068 INFO L226 Difference]: Without dead ends: 8232 [2024-10-24 03:02:23,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:02:23,078 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 748 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:23,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 824 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 03:02:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8232 states. [2024-10-24 03:02:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8232 to 7132. [2024-10-24 03:02:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7132 states, 5811 states have (on average 1.4267768026157288) internal successors, (8291), 5885 states have internal predecessors, (8291), 716 states have call successors, (716), 500 states have call predecessors, (716), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-24 03:02:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7132 states to 7132 states and 10142 transitions. [2024-10-24 03:02:23,970 INFO L78 Accepts]: Start accepts. Automaton has 7132 states and 10142 transitions. Word has length 72 [2024-10-24 03:02:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:23,971 INFO L471 AbstractCegarLoop]: Abstraction has 7132 states and 10142 transitions. [2024-10-24 03:02:23,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7132 states and 10142 transitions. [2024-10-24 03:02:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:23,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:23,979 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] [2024-10-24 03:02:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 03:02:23,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 452703115, now seen corresponding path program 1 times [2024-10-24 03:02:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986501808] [2024-10-24 03:02:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:24,067 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-24 03:02:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986501808] [2024-10-24 03:02:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986501808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:24,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:24,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:02:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190534982] [2024-10-24 03:02:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:24,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:24,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:02:24,070 INFO L87 Difference]: Start difference. First operand 7132 states and 10142 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:25,632 INFO L93 Difference]: Finished difference Result 12134 states and 18022 transitions. [2024-10-24 03:02:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:02:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:25,665 INFO L225 Difference]: With dead ends: 12134 [2024-10-24 03:02:25,665 INFO L226 Difference]: Without dead ends: 8056 [2024-10-24 03:02:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:02:25,680 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 266 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:25,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 776 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:02:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2024-10-24 03:02:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 7198. [2024-10-24 03:02:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5877 states have (on average 1.4219840054449548) internal successors, (8357), 5951 states have internal predecessors, (8357), 716 states have call successors, (716), 500 states have call predecessors, (716), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-24 03:02:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 10208 transitions. [2024-10-24 03:02:26,534 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 10208 transitions. Word has length 72 [2024-10-24 03:02:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:26,535 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 10208 transitions. [2024-10-24 03:02:26,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 10208 transitions. [2024-10-24 03:02:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 03:02:26,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:26,542 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] [2024-10-24 03:02:26,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 03:02:26,543 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:26,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:26,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1346189453, now seen corresponding path program 1 times [2024-10-24 03:02:26,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:26,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177129592] [2024-10-24 03:02:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:26,673 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-24 03:02:26,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:26,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177129592] [2024-10-24 03:02:26,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177129592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:26,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:26,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:02:26,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38506101] [2024-10-24 03:02:26,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:02:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:02:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:26,677 INFO L87 Difference]: Start difference. First operand 7198 states and 10208 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:29,764 INFO L93 Difference]: Finished difference Result 21276 states and 32465 transitions. [2024-10-24 03:02:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 03:02:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-24 03:02:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:29,839 INFO L225 Difference]: With dead ends: 21276 [2024-10-24 03:02:29,839 INFO L226 Difference]: Without dead ends: 17132 [2024-10-24 03:02:29,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-24 03:02:29,866 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1592 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:29,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 906 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:02:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17132 states. [2024-10-24 03:02:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17132 to 14852. [2024-10-24 03:02:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14852 states, 12396 states have (on average 1.4557921910293643) internal successors, (18046), 12585 states have internal predecessors, (18046), 1389 states have call successors, (1389), 898 states have call predecessors, (1389), 1065 states have return successors, (2460), 1406 states have call predecessors, (2460), 1386 states have call successors, (2460) [2024-10-24 03:02:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14852 states to 14852 states and 21895 transitions. [2024-10-24 03:02:31,303 INFO L78 Accepts]: Start accepts. Automaton has 14852 states and 21895 transitions. Word has length 72 [2024-10-24 03:02:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 14852 states and 21895 transitions. [2024-10-24 03:02:31,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:02:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14852 states and 21895 transitions. [2024-10-24 03:02:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 03:02:31,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:31,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:31,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 03:02:31,311 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:31,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1988755210, now seen corresponding path program 1 times [2024-10-24 03:02:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227855809] [2024-10-24 03:02:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:02:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227855809] [2024-10-24 03:02:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227855809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:31,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:02:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455484829] [2024-10-24 03:02:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:02:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:02:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:02:31,416 INFO L87 Difference]: Start difference. First operand 14852 states and 21895 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 03:02:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:34,064 INFO L93 Difference]: Finished difference Result 21150 states and 29738 transitions. [2024-10-24 03:02:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 03:02:34,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-24 03:02:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:34,140 INFO L225 Difference]: With dead ends: 21150 [2024-10-24 03:02:34,140 INFO L226 Difference]: Without dead ends: 16913 [2024-10-24 03:02:34,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-24 03:02:34,161 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 660 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:34,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1179 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:02:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16913 states. [2024-10-24 03:02:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16913 to 16593. [2024-10-24 03:02:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16593 states, 13680 states have (on average 1.4323830409356726) internal successors, (19595), 13912 states have internal predecessors, (19595), 1593 states have call successors, (1593), 1072 states have call predecessors, (1593), 1318 states have return successors, (2842), 1646 states have call predecessors, (2842), 1590 states have call successors, (2842) [2024-10-24 03:02:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16593 states to 16593 states and 24030 transitions. [2024-10-24 03:02:36,218 INFO L78 Accepts]: Start accepts. Automaton has 16593 states and 24030 transitions. Word has length 76 [2024-10-24 03:02:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:36,218 INFO L471 AbstractCegarLoop]: Abstraction has 16593 states and 24030 transitions. [2024-10-24 03:02:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 03:02:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16593 states and 24030 transitions. [2024-10-24 03:02:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 03:02:36,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:36,231 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:36,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 03:02:36,231 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:36,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1969512094, now seen corresponding path program 1 times [2024-10-24 03:02:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089270872] [2024-10-24 03:02:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 03:02:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:02:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:36,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089270872] [2024-10-24 03:02:36,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089270872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:02:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:02:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710361663] [2024-10-24 03:02:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:02:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:02:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:02:36,345 INFO L87 Difference]: Start difference. First operand 16593 states and 24030 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 03:02:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:38,574 INFO L93 Difference]: Finished difference Result 20264 states and 28538 transitions. [2024-10-24 03:02:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 03:02:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-24 03:02:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:38,650 INFO L225 Difference]: With dead ends: 20264 [2024-10-24 03:02:38,650 INFO L226 Difference]: Without dead ends: 16084 [2024-10-24 03:02:38,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-24 03:02:38,675 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1429 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:38,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 880 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:02:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2024-10-24 03:02:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 15750. [2024-10-24 03:02:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15750 states, 13050 states have (on average 1.4386973180076628) internal successors, (18775), 13264 states have internal predecessors, (18775), 1494 states have call successors, (1494), 987 states have call predecessors, (1494), 1204 states have return successors, (2620), 1536 states have call predecessors, (2620), 1491 states have call successors, (2620) [2024-10-24 03:02:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15750 states to 15750 states and 22889 transitions. [2024-10-24 03:02:40,298 INFO L78 Accepts]: Start accepts. Automaton has 15750 states and 22889 transitions. Word has length 86 [2024-10-24 03:02:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:40,299 INFO L471 AbstractCegarLoop]: Abstraction has 15750 states and 22889 transitions. [2024-10-24 03:02:40,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 03:02:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15750 states and 22889 transitions. [2024-10-24 03:02:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 03:02:40,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:40,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 03:02:40,323 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1571587981, now seen corresponding path program 1 times [2024-10-24 03:02:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595506156] [2024-10-24 03:02:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:02:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 03:02:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:02:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595506156] [2024-10-24 03:02:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595506156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378238756] [2024-10-24 03:02:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:40,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:40,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:02:40,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 03:02:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:40,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:02:40,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 03:02:40,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378238756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 03:02:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744703582] [2024-10-24 03:02:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:40,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:40,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:40,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:40,618 INFO L87 Difference]: Start difference. First operand 15750 states and 22889 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:43,748 INFO L93 Difference]: Finished difference Result 39029 states and 59107 transitions. [2024-10-24 03:02:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-24 03:02:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:43,872 INFO L225 Difference]: With dead ends: 39029 [2024-10-24 03:02:43,872 INFO L226 Difference]: Without dead ends: 27231 [2024-10-24 03:02:43,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:43,919 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 297 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:43,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 501 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:02:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2024-10-24 03:02:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 27127. [2024-10-24 03:02:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27127 states, 22773 states have (on average 1.4589206516488824) internal successors, (33224), 23134 states have internal predecessors, (33224), 2460 states have call successors, (2460), 1579 states have call predecessors, (2460), 1892 states have return successors, (4455), 2451 states have call predecessors, (4455), 2457 states have call successors, (4455) [2024-10-24 03:02:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27127 states to 27127 states and 40139 transitions. [2024-10-24 03:02:46,563 INFO L78 Accepts]: Start accepts. Automaton has 27127 states and 40139 transitions. Word has length 116 [2024-10-24 03:02:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 27127 states and 40139 transitions. [2024-10-24 03:02:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:02:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 27127 states and 40139 transitions. [2024-10-24 03:02:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 03:02:46,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:46,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:46,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 03:02:46,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-24 03:02:46,797 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:46,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1242400497, now seen corresponding path program 1 times [2024-10-24 03:02:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:46,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517080012] [2024-10-24 03:02:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 03:02:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:02:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 03:02:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:02:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:02:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 03:02:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:02:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517080012] [2024-10-24 03:02:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517080012] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095456099] [2024-10-24 03:02:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:46,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:02:46,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 03:02:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:47,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:02:47,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 03:02:47,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095456099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 03:02:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670745515] [2024-10-24 03:02:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:47,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:02:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:02:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:47,066 INFO L87 Difference]: Start difference. First operand 27127 states and 40139 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 03:02:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:51,336 INFO L93 Difference]: Finished difference Result 72248 states and 109441 transitions. [2024-10-24 03:02:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:02:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2024-10-24 03:02:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:51,452 INFO L225 Difference]: With dead ends: 72248 [2024-10-24 03:02:51,452 INFO L226 Difference]: Without dead ends: 31084 [2024-10-24 03:02:51,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:02:51,530 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 182 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:51,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 806 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:02:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31084 states. [2024-10-24 03:02:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31084 to 31084. [2024-10-24 03:02:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31084 states, 26159 states have (on average 1.461065025421461) internal successors, (38220), 26552 states have internal predecessors, (38220), 2795 states have call successors, (2795), 1783 states have call predecessors, (2795), 2128 states have return successors, (5085), 2786 states have call predecessors, (5085), 2792 states have call successors, (5085) [2024-10-24 03:02:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31084 states to 31084 states and 46100 transitions. [2024-10-24 03:02:55,034 INFO L78 Accepts]: Start accepts. Automaton has 31084 states and 46100 transitions. Word has length 116 [2024-10-24 03:02:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:02:55,035 INFO L471 AbstractCegarLoop]: Abstraction has 31084 states and 46100 transitions. [2024-10-24 03:02:55,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 03:02:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31084 states and 46100 transitions. [2024-10-24 03:02:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 03:02:55,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:02:55,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:02:55,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 03:02:55,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:55,276 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:02:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:02:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1402910085, now seen corresponding path program 1 times [2024-10-24 03:02:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:02:55,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164987087] [2024-10-24 03:02:55,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:02:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:02:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:02:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:02:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:02:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:02:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:02:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 03:02:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 03:02:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 03:02:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:02:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:02:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 03:02:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 03:02:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 03:02:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-24 03:02:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:02:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164987087] [2024-10-24 03:02:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164987087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:02:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833711185] [2024-10-24 03:02:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:02:55,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:02:55,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:02:55,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:02:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 03:02:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:02:55,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 03:02:55,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:02:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 03:02:55,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:02:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833711185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:02:55,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:02:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-24 03:02:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046716709] [2024-10-24 03:02:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:02:55,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:02:55,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:02:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:02:55,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:02:55,681 INFO L87 Difference]: Start difference. First operand 31084 states and 46100 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 03:02:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:02:58,215 INFO L93 Difference]: Finished difference Result 32931 states and 48353 transitions. [2024-10-24 03:02:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:02:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-24 03:02:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:02:58,313 INFO L225 Difference]: With dead ends: 32931 [2024-10-24 03:02:58,313 INFO L226 Difference]: Without dead ends: 29015 [2024-10-24 03:02:58,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:02:58,328 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 0 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:02:58,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:02:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29015 states. [2024-10-24 03:03:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29015 to 29015. [2024-10-24 03:03:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29015 states, 24667 states have (on average 1.4740746746665585) internal successors, (36361), 25009 states have internal predecessors, (36361), 2519 states have call successors, (2519), 1549 states have call predecessors, (2519), 1827 states have return successors, (4692), 2488 states have call predecessors, (4692), 2516 states have call successors, (4692) [2024-10-24 03:03:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 43572 transitions. [2024-10-24 03:03:01,035 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 43572 transitions. Word has length 131 [2024-10-24 03:03:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:01,035 INFO L471 AbstractCegarLoop]: Abstraction has 29015 states and 43572 transitions. [2024-10-24 03:03:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 03:03:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 43572 transitions. [2024-10-24 03:03:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 03:03:01,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:01,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 03:03:01,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 03:03:01,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 03:03:01,266 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 163824305, now seen corresponding path program 1 times [2024-10-24 03:03:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163216504] [2024-10-24 03:03:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 03:03:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 03:03:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 03:03:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:03:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 03:03:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 03:03:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 03:03:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-24 03:03:01,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:01,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163216504] [2024-10-24 03:03:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163216504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:03:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080348639] [2024-10-24 03:03:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:01,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:03:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:03:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:03:01,349 INFO L87 Difference]: Start difference. First operand 29015 states and 43572 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)