./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d 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 ../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 09:13:17,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 09:13:17,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 09:13:17,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 09:13:17,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 09:13:17,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 09:13:17,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 09:13:17,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 09:13:17,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 09:13:17,556 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 09:13:17,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 09:13:17,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 09:13:17,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 09:13:17,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 09:13:17,559 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 09:13:17,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 09:13:17,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 09:13:17,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 09:13:17,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 09:13:17,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 09:13:17,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 09:13:17,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 09:13:17,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 09:13:17,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 09:13:17,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 09:13:17,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 09:13:17,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 09:13:17,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 09:13:17,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 09:13:17,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 09:13:17,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 09:13:17,565 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 09:13:17,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 09:13:17,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 09:13:17,566 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 09:13:17,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 09:13:17,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 09:13:17,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 09:13:17,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 09:13:17,822 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 09:13:17,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-23 09:13:18,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 09:13:19,263 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 09:13:19,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-23 09:13:19,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6d0d175/dfdb114dd43d4554b48c60d3b9b5c96a/FLAG885f248b2 [2023-11-23 09:13:19,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6d0d175/dfdb114dd43d4554b48c60d3b9b5c96a [2023-11-23 09:13:19,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 09:13:19,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 09:13:19,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 09:13:19,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 09:13:19,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 09:13:19,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:19" (1/1) ... [2023-11-23 09:13:19,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f612c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:19, skipping insertion in model container [2023-11-23 09:13:19,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:19" (1/1) ... [2023-11-23 09:13:19,460 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 09:13:19,632 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-23 09:13:19,640 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-23 09:13:20,182 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,182 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,183 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,183 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,184 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,194 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,195 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,196 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,197 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,388 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 09:13:20,390 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 09:13:20,390 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 09:13:20,394 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 09:13:20,397 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 09:13:20,398 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 09:13:20,398 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 09:13:20,399 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 09:13:20,400 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 09:13:20,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 09:13:20,598 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,599 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 09:13:20,717 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 09:13:20,733 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-23 09:13:20,733 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-23 09:13:20,766 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,767 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,767 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,780 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,780 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,811 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 09:13:20,811 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 09:13:20,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 09:13:20,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 09:13:20,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 09:13:20,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 09:13:20,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 09:13:20,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 09:13:20,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 09:13:20,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 09:13:20,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 09:13:20,874 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,874 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:13:20,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 09:13:20,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 09:13:21,196 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,196 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,196 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,196 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,196 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,197 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,198 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,198 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,198 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,198 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,198 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,199 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,199 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:13:21,205 INFO L206 MainTranslator]: Completed translation [2023-11-23 09:13:21,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21 WrapperNode [2023-11-23 09:13:21,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 09:13:21,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 09:13:21,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 09:13:21,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 09:13:21,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,420 INFO L138 Inliner]: procedures = 689, calls = 2738, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 811 [2023-11-23 09:13:21,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 09:13:21,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 09:13:21,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 09:13:21,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 09:13:21,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 09:13:21,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 09:13:21,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 09:13:21,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 09:13:21,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (1/1) ... [2023-11-23 09:13:21,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 09:13:21,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:13:21,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 09:13:21,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 09:13:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-23 09:13:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-23 09:13:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 09:13:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 09:13:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 09:13:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2023-11-23 09:13:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-23 09:13:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-23 09:13:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-23 09:13:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-23 09:13:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 09:13:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-23 09:13:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-23 09:13:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 09:13:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 09:13:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 09:13:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 09:13:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 09:13:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 09:13:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-23 09:13:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-23 09:13:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-23 09:13:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-23 09:13:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 09:13:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 09:13:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-23 09:13:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-23 09:13:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 09:13:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-23 09:13:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-23 09:13:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 09:13:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-23 09:13:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-23 09:13:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 09:13:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 09:13:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-23 09:13:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-23 09:13:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 09:13:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 09:13:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 09:13:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2023-11-23 09:13:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 09:13:21,834 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 09:13:21,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 09:13:21,975 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-23 09:13:22,533 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 09:13:22,679 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 09:13:22,679 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 09:13:22,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:22 BoogieIcfgContainer [2023-11-23 09:13:22,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 09:13:22,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 09:13:22,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 09:13:22,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 09:13:22,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:13:19" (1/3) ... [2023-11-23 09:13:22,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdb2b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:22, skipping insertion in model container [2023-11-23 09:13:22,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:21" (2/3) ... [2023-11-23 09:13:22,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdb2b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:22, skipping insertion in model container [2023-11-23 09:13:22,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:22" (3/3) ... [2023-11-23 09:13:22,691 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2023-11-23 09:13:22,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 09:13:22,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 09:13:22,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 09:13:22,756 INFO L357 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, mHoare=true, 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;@13d01690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 09:13:22,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 09:13:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-23 09:13:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 09:13:22,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:22,770 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:22,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:22,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1968786091, now seen corresponding path program 1 times [2023-11-23 09:13:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024818522] [2023-11-23 09:13:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:13:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:13:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:13:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 09:13:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024818522] [2023-11-23 09:13:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024818522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 09:13:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225972516] [2023-11-23 09:13:23,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:23,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 09:13:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 09:13:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 09:13:23,461 INFO L87 Difference]: Start difference. First operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 09:13:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:23,848 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2023-11-23 09:13:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 09:13:23,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 66 [2023-11-23 09:13:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:23,864 INFO L225 Difference]: With dead ends: 239 [2023-11-23 09:13:23,864 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 09:13:23,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 09:13:23,869 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:23,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 110 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 09:13:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 09:13:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2023-11-23 09:13:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 64 states have internal predecessors, (75), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-23 09:13:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2023-11-23 09:13:23,958 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 66 [2023-11-23 09:13:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:23,959 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2023-11-23 09:13:23,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 09:13:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2023-11-23 09:13:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 09:13:23,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:23,963 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 09:13:23,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:23,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2021034671, now seen corresponding path program 1 times [2023-11-23 09:13:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534688142] [2023-11-23 09:13:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:13:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:13:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:13:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 09:13:24,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534688142] [2023-11-23 09:13:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534688142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 09:13:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991235938] [2023-11-23 09:13:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 09:13:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 09:13:24,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 09:13:24,558 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 09:13:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:25,140 INFO L93 Difference]: Finished difference Result 170 states and 212 transitions. [2023-11-23 09:13:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 09:13:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 66 [2023-11-23 09:13:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:25,143 INFO L225 Difference]: With dead ends: 170 [2023-11-23 09:13:25,143 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 09:13:25,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 09:13:25,144 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:25,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 288 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 09:13:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 09:13:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2023-11-23 09:13:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2023-11-23 09:13:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2023-11-23 09:13:25,154 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 66 [2023-11-23 09:13:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:25,154 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2023-11-23 09:13:25,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 09:13:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2023-11-23 09:13:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 09:13:25,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:25,156 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:25,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 09:13:25,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:25,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2135310063, now seen corresponding path program 1 times [2023-11-23 09:13:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78192070] [2023-11-23 09:13:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:13:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:13:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:13:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 09:13:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:25,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78192070] [2023-11-23 09:13:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78192070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 09:13:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007991370] [2023-11-23 09:13:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:25,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 09:13:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 09:13:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 09:13:25,694 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 09:13:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:26,217 INFO L93 Difference]: Finished difference Result 186 states and 236 transitions. [2023-11-23 09:13:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 09:13:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 70 [2023-11-23 09:13:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:26,219 INFO L225 Difference]: With dead ends: 186 [2023-11-23 09:13:26,219 INFO L226 Difference]: Without dead ends: 150 [2023-11-23 09:13:26,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 09:13:26,220 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:26,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 290 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 09:13:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-23 09:13:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2023-11-23 09:13:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.173913043478261) internal successors, (81), 70 states have internal predecessors, (81), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 09:13:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2023-11-23 09:13:26,240 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 70 [2023-11-23 09:13:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:26,241 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2023-11-23 09:13:26,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 09:13:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2023-11-23 09:13:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 09:13:26,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:26,244 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:26,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 09:13:26,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:26,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1830886162, now seen corresponding path program 1 times [2023-11-23 09:13:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262245219] [2023-11-23 09:13:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:13:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:13:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:13:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 09:13:27,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262245219] [2023-11-23 09:13:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262245219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:27,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:27,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 09:13:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513293585] [2023-11-23 09:13:27,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:27,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 09:13:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 09:13:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 09:13:27,045 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-23 09:13:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:27,846 INFO L93 Difference]: Finished difference Result 154 states and 195 transitions. [2023-11-23 09:13:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 09:13:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 71 [2023-11-23 09:13:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:27,848 INFO L225 Difference]: With dead ends: 154 [2023-11-23 09:13:27,848 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 09:13:27,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-23 09:13:27,849 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 130 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:27,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 478 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 09:13:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 09:13:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2023-11-23 09:13:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 62 states have internal predecessors, (70), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 09:13:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2023-11-23 09:13:27,867 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 71 [2023-11-23 09:13:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:27,868 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2023-11-23 09:13:27,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-23 09:13:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2023-11-23 09:13:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 09:13:27,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:27,871 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 09:13:27,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:27,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash 312112930, now seen corresponding path program 1 times [2023-11-23 09:13:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105483568] [2023-11-23 09:13:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 09:13:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 09:13:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-23 09:13:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105483568] [2023-11-23 09:13:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105483568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:28,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:28,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 09:13:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92394449] [2023-11-23 09:13:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 09:13:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 09:13:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 09:13:28,428 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 09:13:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:29,126 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2023-11-23 09:13:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 09:13:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 109 [2023-11-23 09:13:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:29,130 INFO L225 Difference]: With dead ends: 180 [2023-11-23 09:13:29,130 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 09:13:29,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-11-23 09:13:29,132 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 108 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:29,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 300 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 09:13:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 09:13:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2023-11-23 09:13:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.140625) internal successors, (73), 65 states have internal predecessors, (73), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-23 09:13:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2023-11-23 09:13:29,146 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 109 [2023-11-23 09:13:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:29,147 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2023-11-23 09:13:29,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 09:13:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2023-11-23 09:13:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 09:13:29,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:29,148 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:29,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 09:13:29,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:29,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 244018785, now seen corresponding path program 1 times [2023-11-23 09:13:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086540567] [2023-11-23 09:13:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 09:13:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 09:13:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-23 09:13:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086540567] [2023-11-23 09:13:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086540567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:29,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 09:13:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251518533] [2023-11-23 09:13:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 09:13:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 09:13:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-23 09:13:29,771 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 09:13:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:30,462 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2023-11-23 09:13:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 09:13:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 113 [2023-11-23 09:13:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:30,464 INFO L225 Difference]: With dead ends: 187 [2023-11-23 09:13:30,464 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 09:13:30,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-11-23 09:13:30,465 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 166 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:30,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 326 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 09:13:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 09:13:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-11-23 09:13:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 09:13:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2023-11-23 09:13:30,472 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 113 [2023-11-23 09:13:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:30,473 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2023-11-23 09:13:30,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 09:13:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2023-11-23 09:13:30,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 09:13:30,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:30,475 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:30,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 09:13:30,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:30,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1977080535, now seen corresponding path program 1 times [2023-11-23 09:13:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833181008] [2023-11-23 09:13:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:33,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 09:13:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 09:13:34,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:34,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833181008] [2023-11-23 09:13:34,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833181008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:34,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:34,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-23 09:13:34,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817905111] [2023-11-23 09:13:34,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:34,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 09:13:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 09:13:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2023-11-23 09:13:34,071 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 09:13:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:35,979 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2023-11-23 09:13:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-23 09:13:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2023-11-23 09:13:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:35,981 INFO L225 Difference]: With dead ends: 175 [2023-11-23 09:13:35,981 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 09:13:35,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1800, Unknown=0, NotChecked=0, Total=1980 [2023-11-23 09:13:35,983 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 155 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:35,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 809 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-23 09:13:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 09:13:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2023-11-23 09:13:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 states have internal predecessors, (75), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2023-11-23 09:13:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2023-11-23 09:13:36,004 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 119 [2023-11-23 09:13:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:36,005 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2023-11-23 09:13:36,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 09:13:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2023-11-23 09:13:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 09:13:36,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:36,009 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:36,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 09:13:36,010 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:36,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -202073173, now seen corresponding path program 1 times [2023-11-23 09:13:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611561966] [2023-11-23 09:13:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 09:13:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 09:13:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611561966] [2023-11-23 09:13:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611561966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:36,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:36,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-23 09:13:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082597073] [2023-11-23 09:13:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 09:13:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 09:13:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2023-11-23 09:13:36,829 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:38,054 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2023-11-23 09:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 09:13:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) Word has length 119 [2023-11-23 09:13:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:38,056 INFO L225 Difference]: With dead ends: 173 [2023-11-23 09:13:38,056 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 09:13:38,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 09:13:38,057 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:38,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 681 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 09:13:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 09:13:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2023-11-23 09:13:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 74 states have internal predecessors, (79), 34 states have call successors, (34), 16 states have call predecessors, (34), 19 states have return successors, (38), 33 states have call predecessors, (38), 33 states have call successors, (38) [2023-11-23 09:13:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2023-11-23 09:13:38,066 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 119 [2023-11-23 09:13:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:38,067 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2023-11-23 09:13:38,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2023-11-23 09:13:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 09:13:38,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:38,069 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:38,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 09:13:38,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:38,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 477985197, now seen corresponding path program 1 times [2023-11-23 09:13:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:38,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122267797] [2023-11-23 09:13:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 09:13:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 09:13:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122267797] [2023-11-23 09:13:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122267797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:38,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 09:13:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221650892] [2023-11-23 09:13:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:38,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 09:13:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 09:13:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-23 09:13:38,804 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:39,895 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2023-11-23 09:13:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 09:13:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) Word has length 119 [2023-11-23 09:13:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:39,896 INFO L225 Difference]: With dead ends: 183 [2023-11-23 09:13:39,896 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 09:13:39,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2023-11-23 09:13:39,897 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:39,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 574 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 09:13:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 09:13:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2023-11-23 09:13:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 72 states have internal predecessors, (78), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 09:13:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2023-11-23 09:13:39,904 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 119 [2023-11-23 09:13:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:39,905 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2023-11-23 09:13:39,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2023-11-23 09:13:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 09:13:39,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:39,905 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:39,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 09:13:39,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:39,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash -434438041, now seen corresponding path program 1 times [2023-11-23 09:13:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035541966] [2023-11-23 09:13:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 09:13:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 09:13:40,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035541966] [2023-11-23 09:13:40,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035541966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:13:40,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:13:40,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 09:13:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105741191] [2023-11-23 09:13:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:13:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 09:13:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 09:13:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-23 09:13:40,479 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:13:40,977 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2023-11-23 09:13:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 09:13:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 120 [2023-11-23 09:13:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:13:40,979 INFO L225 Difference]: With dead ends: 176 [2023-11-23 09:13:40,979 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 09:13:40,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-23 09:13:40,980 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 09:13:40,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 207 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 09:13:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 09:13:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2023-11-23 09:13:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 09:13:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2023-11-23 09:13:40,993 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 120 [2023-11-23 09:13:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:13:40,994 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2023-11-23 09:13:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 09:13:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2023-11-23 09:13:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-23 09:13:40,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:13:40,995 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:13:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 09:13:40,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:13:40,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:13:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash 857010603, now seen corresponding path program 1 times [2023-11-23 09:13:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:13:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287984705] [2023-11-23 09:13:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:13:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:13:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:13:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:13:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:13:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:13:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:13:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:13:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:13:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:13:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:13:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:13:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:13:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:13:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:13:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 09:13:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 09:13:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:13:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287984705] [2023-11-23 09:13:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287984705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:13:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243011429] [2023-11-23 09:13:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:13:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:13:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:13:47,637 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) [2023-11-23 09:13:47,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 09:13:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:13:48,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 2918 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-23 09:13:48,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:13:48,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 09:13:49,038 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_2 Int) (v_y_2 Int)) (let ((.cse1 (* 18446744073709551616 v_y_2))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ v_z_2 |c_#Ultimate.C_memcpy_dest.offset| .cse1))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))) |c_#memory_int|) (<= 0 v_z_2) (<= 0 (+ v_z_2 .cse1)) (<= (+ v_z_2 1) (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2023-11-23 09:13:49,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:13:49,552 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2023-11-23 09:13:49,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 104 [2023-11-23 09:13:49,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2023-11-23 09:13:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:13:49,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2023-11-23 09:13:49,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:13:49,606 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-11-23 09:13:49,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 29 [2023-11-23 09:13:49,686 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-11-23 09:13:49,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-23 09:13:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 1 not checked. [2023-11-23 09:13:50,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:13:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243011429] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:13:52,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:13:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 31] total 66 [2023-11-23 09:13:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632987583] [2023-11-23 09:13:52,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:13:52,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-23 09:13:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:13:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-23 09:13:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=5209, Unknown=2, NotChecked=144, Total=5550 [2023-11-23 09:13:52,053 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 66 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 48 states have internal predecessors, (96), 18 states have call successors, (45), 10 states have call predecessors, (45), 14 states have return successors, (42), 19 states have call predecessors, (42), 17 states have call successors, (42) [2023-11-23 09:14:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:14:04,747 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2023-11-23 09:14:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-23 09:14:04,748 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 48 states have internal predecessors, (96), 18 states have call successors, (45), 10 states have call predecessors, (45), 14 states have return successors, (42), 19 states have call predecessors, (42), 17 states have call successors, (42) Word has length 121 [2023-11-23 09:14:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:14:04,749 INFO L225 Difference]: With dead ends: 255 [2023-11-23 09:14:04,749 INFO L226 Difference]: Without dead ends: 208 [2023-11-23 09:14:04,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3692 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1020, Invalid=18442, Unknown=2, NotChecked=276, Total=19740 [2023-11-23 09:14:04,753 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 267 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 7515 mSolverCounterSat, 179 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 7936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 7515 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-23 09:14:04,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1943 Invalid, 7936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [179 Valid, 7515 Invalid, 9 Unknown, 233 Unchecked, 8.4s Time] [2023-11-23 09:14:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-23 09:14:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2023-11-23 09:14:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 103 states have (on average 1.145631067961165) internal successors, (118), 108 states have internal predecessors, (118), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-23 09:14:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2023-11-23 09:14:04,768 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 121 [2023-11-23 09:14:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:14:04,768 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2023-11-23 09:14:04,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 48 states have internal predecessors, (96), 18 states have call successors, (45), 10 states have call predecessors, (45), 14 states have return successors, (42), 19 states have call predecessors, (42), 17 states have call successors, (42) [2023-11-23 09:14:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2023-11-23 09:14:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 09:14:04,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:14:04,769 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:14:04,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 09:14:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 09:14:04,985 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:14:04,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:14:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1572730217, now seen corresponding path program 2 times [2023-11-23 09:14:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:14:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104668308] [2023-11-23 09:14:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:14:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:14:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:14:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:14:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:14:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:14:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:14:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:14:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:14:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:14:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:14:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:14:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:14:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:14:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 09:14:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 09:14:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:14:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104668308] [2023-11-23 09:14:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104668308] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063385117] [2023-11-23 09:14:10,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 09:14:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:14:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:14:10,618 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) [2023-11-23 09:14:10,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 09:14:11,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 09:14:11,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 09:14:11,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-23 09:14:11,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:14:11,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 09:14:11,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:11,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:12,004 INFO L349 Elim1Store]: treesize reduction 72, result has 32.1 percent of original size [2023-11-23 09:14:12,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 104 [2023-11-23 09:14:12,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2023-11-23 09:14:12,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:12,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:12,031 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-11-23 09:14:12,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 29 [2023-11-23 09:14:12,102 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 09:14:12,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-23 09:14:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 94 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 09:14:12,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:14:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063385117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:14,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:14:14,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 56 [2023-11-23 09:14:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37973038] [2023-11-23 09:14:14,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:14:14,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-23 09:14:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:14:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-23 09:14:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3982, Unknown=0, NotChecked=0, Total=4160 [2023-11-23 09:14:14,076 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 56 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2023-11-23 09:14:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:14:25,416 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2023-11-23 09:14:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 09:14:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) Word has length 122 [2023-11-23 09:14:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:14:25,418 INFO L225 Difference]: With dead ends: 249 [2023-11-23 09:14:25,418 INFO L226 Difference]: Without dead ends: 247 [2023-11-23 09:14:25,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3245 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1012, Invalid=14738, Unknown=0, NotChecked=0, Total=15750 [2023-11-23 09:14:25,422 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 379 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 5752 mSolverCounterSat, 295 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 6053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 5752 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-23 09:14:25,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1271 Invalid, 6053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 5752 Invalid, 6 Unknown, 0 Unchecked, 8.0s Time] [2023-11-23 09:14:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-23 09:14:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 169. [2023-11-23 09:14:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 106 states have internal predecessors, (120), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 09:14:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2023-11-23 09:14:25,442 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 122 [2023-11-23 09:14:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:14:25,443 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2023-11-23 09:14:25,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2023-11-23 09:14:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2023-11-23 09:14:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 09:14:25,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:14:25,444 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:14:25,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 09:14:25,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 09:14:25,645 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:14:25,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:14:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2009765525, now seen corresponding path program 3 times [2023-11-23 09:14:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:14:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755307237] [2023-11-23 09:14:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:14:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:14:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:14:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:14:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:14:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:14:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:14:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:14:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:14:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:14:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:14:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:14:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:14:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:14:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 09:14:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 09:14:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:14:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755307237] [2023-11-23 09:14:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755307237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002479039] [2023-11-23 09:14:33,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 09:14:33,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:14:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:14:33,021 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) [2023-11-23 09:14:33,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 09:14:34,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 09:14:34,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 09:14:34,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 2870 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-23 09:14:34,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:14:35,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 09:14:35,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,853 INFO L349 Elim1Store]: treesize reduction 96, result has 33.8 percent of original size [2023-11-23 09:14:35,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 134 [2023-11-23 09:14:35,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:35,887 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-23 09:14:35,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 45 [2023-11-23 09:14:35,964 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 09:14:35,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 09:14:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-11-23 09:14:36,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:14:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002479039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:38,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:14:38,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 66 [2023-11-23 09:14:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126712834] [2023-11-23 09:14:38,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:14:38,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-23 09:14:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:14:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-23 09:14:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5337, Unknown=0, NotChecked=0, Total=5550 [2023-11-23 09:14:38,050 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 66 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 12 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (42), 16 states have call predecessors, (42), 11 states have call successors, (42) [2023-11-23 09:14:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:14:51,709 INFO L93 Difference]: Finished difference Result 314 states and 387 transitions. [2023-11-23 09:14:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-23 09:14:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 12 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (42), 16 states have call predecessors, (42), 11 states have call successors, (42) Word has length 123 [2023-11-23 09:14:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:14:51,715 INFO L225 Difference]: With dead ends: 314 [2023-11-23 09:14:51,715 INFO L226 Difference]: Without dead ends: 312 [2023-11-23 09:14:51,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3757 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=961, Invalid=17399, Unknown=0, NotChecked=0, Total=18360 [2023-11-23 09:14:51,719 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 317 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 7216 mSolverCounterSat, 194 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 7424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 7216 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-11-23 09:14:51,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 2310 Invalid, 7424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 7216 Invalid, 14 Unknown, 0 Unchecked, 10.0s Time] [2023-11-23 09:14:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-23 09:14:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 172. [2023-11-23 09:14:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 109 states have internal predecessors, (125), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 09:14:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2023-11-23 09:14:51,739 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 123 [2023-11-23 09:14:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:14:51,739 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2023-11-23 09:14:51,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 12 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (42), 16 states have call predecessors, (42), 11 states have call successors, (42) [2023-11-23 09:14:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2023-11-23 09:14:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-23 09:14:51,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:14:51,741 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:14:51,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 09:14:51,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:14:51,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:14:51,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:14:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1609374359, now seen corresponding path program 4 times [2023-11-23 09:14:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:14:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48870418] [2023-11-23 09:14:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:14:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:14:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:14:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:14:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:14:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:14:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:14:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:14:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:14:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:14:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:14:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:14:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:14:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:14:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:14:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:14:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 09:14:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:14:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-23 09:14:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:14:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48870418] [2023-11-23 09:14:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48870418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173916192] [2023-11-23 09:14:52,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 09:14:52,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:14:52,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:14:52,594 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) [2023-11-23 09:14:52,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 09:14:53,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 09:14:53,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 09:14:53,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 3101 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-23 09:14:53,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:14:53,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 09:14:56,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:56,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,062 INFO L349 Elim1Store]: treesize reduction 669, result has 19.3 percent of original size [2023-11-23 09:14:57,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 204 treesize of output 282 [2023-11-23 09:14:57,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,248 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-23 09:14:57,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 42 [2023-11-23 09:14:57,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 80 [2023-11-23 09:14:57,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,304 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-23 09:14:57,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 52 [2023-11-23 09:14:57,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:14:57,320 INFO L349 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2023-11-23 09:14:57,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 71 treesize of output 51 [2023-11-23 09:14:57,381 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 09:14:57,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 09:14:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-11-23 09:14:58,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:14:59,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173916192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:14:59,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:14:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 42] total 51 [2023-11-23 09:14:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453883059] [2023-11-23 09:14:59,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:14:59,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-23 09:14:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:14:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-23 09:14:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=3384, Unknown=1, NotChecked=0, Total=3540 [2023-11-23 09:14:59,749 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand has 51 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 35 states have internal predecessors, (92), 11 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (35), 13 states have call predecessors, (35), 10 states have call successors, (35) [2023-11-23 09:15:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:15:08,674 INFO L93 Difference]: Finished difference Result 334 states and 403 transitions. [2023-11-23 09:15:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-23 09:15:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 35 states have internal predecessors, (92), 11 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (35), 13 states have call predecessors, (35), 10 states have call successors, (35) Word has length 124 [2023-11-23 09:15:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:15:08,676 INFO L225 Difference]: With dead ends: 334 [2023-11-23 09:15:08,676 INFO L226 Difference]: Without dead ends: 238 [2023-11-23 09:15:08,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=621, Invalid=10720, Unknown=1, NotChecked=0, Total=11342 [2023-11-23 09:15:08,678 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 184 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 5453 mSolverCounterSat, 125 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 5585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 5453 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-23 09:15:08,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1787 Invalid, 5585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 5453 Invalid, 7 Unknown, 0 Unchecked, 6.6s Time] [2023-11-23 09:15:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-23 09:15:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 171. [2023-11-23 09:15:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.1923076923076923) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 09:15:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 210 transitions. [2023-11-23 09:15:08,697 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 210 transitions. Word has length 124 [2023-11-23 09:15:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:15:08,697 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 210 transitions. [2023-11-23 09:15:08,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 35 states have internal predecessors, (92), 11 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (35), 13 states have call predecessors, (35), 10 states have call successors, (35) [2023-11-23 09:15:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 210 transitions. [2023-11-23 09:15:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-23 09:15:08,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:15:08,699 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:15:08,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 09:15:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:15:08,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:15:08,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:15:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1397983831, now seen corresponding path program 5 times [2023-11-23 09:15:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:15:08,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524143860] [2023-11-23 09:15:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:15:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:15:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:15:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:15:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:15:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:15:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:15:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:15:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:15:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:15:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:15:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:15:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:15:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:15:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:15:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:15:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 09:15:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 09:15:16,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:15:16,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524143860] [2023-11-23 09:15:16,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524143860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:15:16,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022523886] [2023-11-23 09:15:16,860 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-23 09:15:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:15:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:15:16,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 09:15:16,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 09:15:23,249 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-23 09:15:23,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 09:15:23,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 3329 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-23 09:15:23,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:15:23,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 09:15:24,223 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_38| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse3 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_38| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse2 (+ 2 |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy_dest.offset| 1))) (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select .cse0 |c_#Ultimate.C_memcpy_dest.offset|)) .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (select .cse0 .cse3)))) |c_#memory_int|) (<= 3 |v_#Ultimate.C_memcpy_#t~loopctr1331_38|))) is different from true [2023-11-23 09:15:24,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:15:24,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:15:24,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:15:24,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:15:24,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2023-11-23 09:15:24,632 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 09:15:24,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 09:15:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 3 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 4 not checked. [2023-11-23 09:15:25,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:15:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022523886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:15:27,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:15:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38] total 74 [2023-11-23 09:15:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752680725] [2023-11-23 09:15:27,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:15:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-23 09:15:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:15:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-23 09:15:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=6418, Unknown=1, NotChecked=160, Total=6806 [2023-11-23 09:15:27,011 INFO L87 Difference]: Start difference. First operand 171 states and 210 transitions. Second operand has 74 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 55 states have internal predecessors, (107), 15 states have call successors, (45), 11 states have call predecessors, (45), 16 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) [2023-11-23 09:15:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:15:45,964 INFO L93 Difference]: Finished difference Result 363 states and 448 transitions. [2023-11-23 09:15:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-23 09:15:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 55 states have internal predecessors, (107), 15 states have call successors, (45), 11 states have call predecessors, (45), 16 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) Word has length 124 [2023-11-23 09:15:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:15:45,966 INFO L225 Difference]: With dead ends: 363 [2023-11-23 09:15:45,966 INFO L226 Difference]: Without dead ends: 316 [2023-11-23 09:15:45,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5169 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1324, Invalid=24118, Unknown=2, NotChecked=316, Total=25760 [2023-11-23 09:15:45,968 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 388 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 9430 mSolverCounterSat, 282 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 9978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 9430 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-23 09:15:45,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2441 Invalid, 9978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 9430 Invalid, 10 Unknown, 256 Unchecked, 13.7s Time] [2023-11-23 09:15:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-23 09:15:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 172. [2023-11-23 09:15:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 105 states have (on average 1.2) internal successors, (126), 109 states have internal predecessors, (126), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 09:15:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2023-11-23 09:15:45,995 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 124 [2023-11-23 09:15:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:15:45,995 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2023-11-23 09:15:45,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 55 states have internal predecessors, (107), 15 states have call successors, (45), 11 states have call predecessors, (45), 16 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) [2023-11-23 09:15:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2023-11-23 09:15:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 09:15:45,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:15:45,996 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:15:46,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 09:15:46,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 09:15:46,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:15:46,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:15:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash 387379499, now seen corresponding path program 6 times [2023-11-23 09:15:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:15:46,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286959929] [2023-11-23 09:15:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:15:46,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:15:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:15:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:15:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:15:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:15:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:15:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:15:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:15:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:15:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:15:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:15:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:15:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:15:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:15:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:15:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:15:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 09:15:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:15:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 09:15:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:15:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286959929] [2023-11-23 09:15:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286959929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:15:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119492827] [2023-11-23 09:15:54,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-23 09:15:54,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:15:54,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:15:54,809 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 09:15:54,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 09:16:26,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-23 09:16:26,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 09:16:26,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 3440 conjuncts, 168 conjunts are in the unsatisfiable core [2023-11-23 09:16:26,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:16:27,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 09:16:27,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 11 [2023-11-23 09:16:27,963 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 09:16:27,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-23 09:16:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-11-23 09:16:28,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:16:30,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119492827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:16:30,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:16:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 44] total 74 [2023-11-23 09:16:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184617911] [2023-11-23 09:16:30,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:16:30,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-23 09:16:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:16:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-23 09:16:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=6564, Unknown=0, NotChecked=0, Total=6806 [2023-11-23 09:16:30,509 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 74 states, 53 states have (on average 2.018867924528302) internal successors, (107), 55 states have internal predecessors, (107), 16 states have call successors, (45), 10 states have call predecessors, (45), 16 states have return successors, (42), 18 states have call predecessors, (42), 15 states have call successors, (42) [2023-11-23 09:16:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:16:51,001 INFO L93 Difference]: Finished difference Result 303 states and 364 transitions. [2023-11-23 09:16:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-23 09:16:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 53 states have (on average 2.018867924528302) internal successors, (107), 55 states have internal predecessors, (107), 16 states have call successors, (45), 10 states have call predecessors, (45), 16 states have return successors, (42), 18 states have call predecessors, (42), 15 states have call successors, (42) Word has length 125 [2023-11-23 09:16:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:16:51,003 INFO L225 Difference]: With dead ends: 303 [2023-11-23 09:16:51,003 INFO L226 Difference]: Without dead ends: 301 [2023-11-23 09:16:51,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5261 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1140, Invalid=23040, Unknown=0, NotChecked=0, Total=24180 [2023-11-23 09:16:51,005 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 319 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 8215 mSolverCounterSat, 172 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 8393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 8215 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2023-11-23 09:16:51,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1217 Invalid, 8393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 8215 Invalid, 6 Unknown, 0 Unchecked, 15.9s Time] [2023-11-23 09:16:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-23 09:16:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 174. [2023-11-23 09:16:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 107 states have (on average 1.205607476635514) internal successors, (129), 111 states have internal predecessors, (129), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 09:16:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2023-11-23 09:16:51,029 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 125 [2023-11-23 09:16:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:16:51,029 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2023-11-23 09:16:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 53 states have (on average 2.018867924528302) internal successors, (107), 55 states have internal predecessors, (107), 16 states have call successors, (45), 10 states have call predecessors, (45), 16 states have return successors, (42), 18 states have call predecessors, (42), 15 states have call successors, (42) [2023-11-23 09:16:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2023-11-23 09:16:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-23 09:16:51,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:16:51,031 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:16:51,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 09:16:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 09:16:51,249 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:16:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:16:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1694588505, now seen corresponding path program 7 times [2023-11-23 09:16:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:16:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32329233] [2023-11-23 09:16:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:16:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:16:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:16:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 09:16:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 09:16:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 09:16:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 09:16:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 09:16:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 09:16:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:16:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:16:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 09:16:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 09:16:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 09:16:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:16:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:16:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:16:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-23 09:16:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-23 09:16:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:16:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32329233] [2023-11-23 09:16:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32329233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:16:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731308906] [2023-11-23 09:16:52,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 09:16:52,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:16:52,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:16:52,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 09:16:52,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 09:16:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:16:52,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 3261 conjuncts, 152 conjunts are in the unsatisfiable core [2023-11-23 09:16:52,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:16:53,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 09:16:53,185 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |c_#Ultimate.C_memcpy_#t~loopctr1331|))) is different from true [2023-11-23 09:16:53,197 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |c_#Ultimate.C_memcpy_#t~loopctr1331|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse1 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2)))) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|))) is different from true [2023-11-23 09:16:53,216 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse1 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse3 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) is different from true [2023-11-23 09:17:00,284 WARN L854 $PredicateComparison]: unable to prove that (and (<= 17 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (let ((.cse7 (+ 16 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse5 (+ |c_#Ultimate.C_memcpy_dest.offset| 8)) (.cse2 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|))) (let ((.cse0 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse4 (select .cse2 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse6 (select .cse2 .cse5)) (.cse8 (select .cse2 .cse7))) (or (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse3 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse1 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse1 (select .cse2 .cse1))) .cse3 (select .cse2 .cse3))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse10 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse9 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse9 (select .cse2 .cse9))) .cse10 (select .cse2 .cse10))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse12 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse11 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse11 (select .cse2 .cse11))) .cse12 (select .cse2 .cse12))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8))) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse13 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse13 (select .cse2 .cse13))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse15 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse14 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse14 (select .cse2 .cse14))) .cse15 (select .cse2 .cse15))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse16 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse16 (select .cse2 .cse16))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 15) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse18 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse17 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse17 (select .cse2 .cse17))) .cse18 (select .cse2 .cse18))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse20 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse19 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse19 (select .cse2 .cse19))) .cse20 (select .cse2 .cse20))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse21 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse21 (select .cse2 .cse21))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse23 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse22 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse22 (select .cse2 .cse22))) .cse23 (select .cse2 .cse23))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse24 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse24 (select .cse2 .cse24))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse25 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse25 (select .cse2 .cse25))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse28 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse27 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse26 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse26 (select .cse2 .cse26))) .cse27 (select .cse2 .cse27))) .cse28 (select .cse2 .cse28))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8))) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store .cse0 |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (let ((.cse29 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse29 (select .cse2 .cse29))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15)))))) (= |c_#Ultimate.C_memcpy_#t~loopctr1340| 24)) is different from false [2023-11-23 09:17:03,246 WARN L854 $PredicateComparison]: unable to prove that (and (<= 17 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= 32 |c_#Ultimate.C_memcpy_#t~loopctr1340|) (let ((.cse8 (+ |c_#Ultimate.C_memcpy_dest.offset| 24)) (.cse6 (+ 16 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse4 (+ |c_#Ultimate.C_memcpy_dest.offset| 8)) (.cse2 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|))) (let ((.cse0 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse3 (select .cse2 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse5 (select .cse2 .cse4)) (.cse7 (select .cse2 .cse6)) (.cse9 (select .cse2 .cse8))) (or (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse1 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse1 (select .cse2 .cse1))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse11 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse10 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse10 (select .cse2 .cse10))) .cse11 (select .cse2 .cse11))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 15) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse13 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse12 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse12 (select .cse2 .cse12))) .cse13 (select .cse2 .cse13))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 23) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse15 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse14 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse14 (select .cse2 .cse14))) .cse15 (select .cse2 .cse15))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store .cse0 |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse17 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse16 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse16 (select .cse2 .cse16))) .cse17 (select .cse2 .cse17))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse18 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse18 (select .cse2 .cse18))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse20 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse19 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse19 (select .cse2 .cse19))) .cse20 (select .cse2 .cse20))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse22 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse21 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse21 (select .cse2 .cse21))) .cse22 (select .cse2 .cse22))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse23 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse23 (select .cse2 .cse23))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse25 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse24 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse24 (select .cse2 .cse24))) .cse25 (select .cse2 .cse25))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse26 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse26 (select .cse2 .cse26))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 15) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse27 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse27 (select .cse2 .cse27))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse29 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse28 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse28 (select .cse2 .cse28))) .cse29 (select .cse2 .cse29))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse30 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse30 (select .cse2 .cse30))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse32 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse31 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse31 (select .cse2 .cse31))) .cse32 (select .cse2 .cse32))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse33 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse33 (select .cse2 .cse33))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse34 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse34 (select .cse2 .cse34))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 24)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse37 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse36 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse35 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse35 (select .cse2 .cse35))) .cse36 (select .cse2 .cse36))) .cse37 (select .cse2 .cse37))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse38 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse38 (select .cse2 .cse38))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse39 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse39 (select .cse2 .cse39))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse40 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse40 (select .cse2 .cse40))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse42 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse41 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse41 (select .cse2 .cse41))) .cse42 (select .cse2 .cse42))) |c_#Ultimate.C_memcpy_dest.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9)) |c_#memory_int|))))))) is different from false [2023-11-23 09:17:05,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) (and (<= 17 .cse0) (= |c_#Ultimate.C_memcpy_#res.base| |c_#Ultimate.C_memcpy_dest.base|) (let ((.cse9 (+ |c_#Ultimate.C_memcpy_dest.offset| 24)) (.cse7 (+ 16 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse5 (+ |c_#Ultimate.C_memcpy_dest.offset| 8)) (.cse3 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|))) (let ((.cse1 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse4 (select .cse3 |c_#Ultimate.C_memcpy_dest.offset|)) (.cse6 (select .cse3 .cse5)) (.cse8 (select .cse3 .cse7)) (.cse10 (select .cse3 .cse9))) (or (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse2 (select .cse3 .cse2))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse12 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse11 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse11 (select .cse3 .cse11))) .cse12 (select .cse3 .cse12))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 15) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse14 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse13 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse13 (select .cse3 .cse13))) .cse14 (select .cse3 .cse14))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 23) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse16 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse15 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse15 (select .cse3 .cse15))) .cse16 (select .cse3 .cse16))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store .cse1 |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse18 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse17 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse17 (select .cse3 .cse17))) .cse18 (select .cse3 .cse18))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse19 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse19 (select .cse3 .cse19))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse21 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse20 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse20 (select .cse3 .cse20))) .cse21 (select .cse3 .cse21))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse23 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse22 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse22 (select .cse3 .cse22))) .cse23 (select .cse3 .cse23))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 7) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse24 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse24 (select .cse3 .cse24))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse26 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse25 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse25 (select .cse3 .cse25))) .cse26 (select .cse3 .cse26))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse27 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse27 (select .cse3 .cse27))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 15) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse28 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse28 (select .cse3 .cse28))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse30 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse29 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse29 (select .cse3 .cse29))) .cse30 (select .cse3 .cse30))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse31 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse31 (select .cse3 .cse31))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse33 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse32 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse32 (select .cse3 .cse32))) .cse33 (select .cse3 .cse33))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int)) (and (<= 25 |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse34 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse34 (select .cse3 .cse34))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse35 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse35 (select .cse3 .cse35))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_61| Int)) (and (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 16)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 24)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1331_61|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 0)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_61| 16)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse38 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse37 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse36 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_61| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse36 (select .cse3 .cse36))) .cse37 (select .cse3 .cse37))) .cse38 (select .cse3 .cse38))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 8)) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse39 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse39 (select .cse3 .cse39))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 23))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 7) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse40 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse40 (select .cse3 .cse40))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse41 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse41 (select .cse3 .cse41))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|) (<= 9 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (<= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 15))) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1331_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1331_62| Int)) (and (<= 17 |v_#Ultimate.C_memcpy_#t~loopctr1331_62|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_63| 24)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1331_63|) (not (= |v_#Ultimate.C_memcpy_#t~loopctr1331_62| 24)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (let ((.cse43 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_63| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse42 (+ |v_#Ultimate.C_memcpy_#t~loopctr1331_62| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse42 (select .cse3 .cse42))) .cse43 (select .cse3 .cse43))) |c_#Ultimate.C_memcpy_dest.offset| .cse4) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10)) |c_#memory_int|)))))) (<= .cse0 32))) is different from false [2023-11-23 09:17:06,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:17:06,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:17:06,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:17:06,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:17:21,438 WARN L293 SmtUtils]: Spent 15.31s on a formula simplification. DAG size of input: 1065 DAG size of output: 267 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 09:17:21,438 INFO L349 Elim1Store]: treesize reduction 5331, result has 11.7 percent of original size [2023-11-23 09:17:21,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 23 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 24 new quantified variables, introduced 56 case distinctions, treesize of input 1833 treesize of output 4447 Killed by 15