./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness_negated.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_linked_list_push_back_harness_negated.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 039075241b3e03e605f8b837c5703607fb327de3ebb7fe9349592ff866b009f9 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:52:56,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:52:56,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:52:56,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:52:56,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:52:56,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:52:56,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:52:56,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:52:56,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:52:56,619 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:52:56,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:52:56,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:52:56,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:52:56,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:52:56,621 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:52:56,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:52:56,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:52:56,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:52:56,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:52:56,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:52:56,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:52:56,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:52:56,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:52:56,623 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:52:56,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:52:56,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:52:56,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:52:56,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:52:56,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:56,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:52:56,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:52:56,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:52:56,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:52:56,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:52:56,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:52:56,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:52:56,626 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:52:56,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:52:56,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:52:56,627 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 -> 039075241b3e03e605f8b837c5703607fb327de3ebb7fe9349592ff866b009f9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:52:56,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:52:56,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:52:56,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:52:56,876 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:52:56,877 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:52:56,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness_negated.i [2023-11-23 08:52:58,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:52:58,451 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:52:58,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness_negated.i [2023-11-23 08:52:58,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4087cbda0/64abdad9a8a44ecdae4e502ec9573579/FLAG8015d2942 [2023-11-23 08:52:58,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4087cbda0/64abdad9a8a44ecdae4e502ec9573579 [2023-11-23 08:52:58,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:52:58,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:52:58,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:58,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:52:58,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:52:58,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:58" (1/1) ... [2023-11-23 08:52:58,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d66e89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:58, skipping insertion in model container [2023-11-23 08:52:58,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:58" (1/1) ... [2023-11-23 08:52:58,584 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:52:58,763 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_linked_list_push_back_harness_negated.i[4499,4512] [2023-11-23 08:52:58,771 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_linked_list_push_back_harness_negated.i[4559,4572] [2023-11-23 08:52:59,269 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,272 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,273 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,274 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,275 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,284 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,285 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,286 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,287 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,288 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,288 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,289 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,289 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,504 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:59,505 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:59,506 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:59,507 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:59,510 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:59,510 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:59,511 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:59,511 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:59,512 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:59,516 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:59,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:59,618 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:52:59,628 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_linked_list_push_back_harness_negated.i[4499,4512] [2023-11-23 08:52:59,628 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_linked_list_push_back_harness_negated.i[4559,4572] [2023-11-23 08:52:59,666 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,673 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,674 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,676 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,677 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,684 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,691 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,692 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,694 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,697 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,697 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,698 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,698 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:59,723 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:59,727 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:59,728 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:59,729 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:59,730 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:59,736 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:59,737 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:59,737 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:59,738 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:59,738 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:59,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:00,002 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,003 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,003 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,003 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,003 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,004 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,004 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,004 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,004 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,005 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,005 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,005 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,005 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,005 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,006 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,006 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:00,013 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:53:00,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00 WrapperNode [2023-11-23 08:53:00,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:53:00,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:00,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:53:00,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:53:00,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,120 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 149 [2023-11-23 08:53:00,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:00,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:53:00,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:53:00,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:53:00,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:53:00,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:53:00,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:53:00,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:53:00,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (1/1) ... [2023-11-23 08:53:00,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:53:00,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:00,198 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 08:53:00,200 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 08:53:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:53:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:53:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:53:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:53:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:53:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:53:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:53:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:53:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:53:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:53:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:53:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:53:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:53:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:53:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:53:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:53:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:53:00,475 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:53:00,481 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:53:00,719 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:53:00,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:53:00,743 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:53:00,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:00 BoogieIcfgContainer [2023-11-23 08:53:00,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:53:00,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:53:00,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:53:00,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:53:00,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:58" (1/3) ... [2023-11-23 08:53:00,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23044c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:00, skipping insertion in model container [2023-11-23 08:53:00,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:00" (2/3) ... [2023-11-23 08:53:00,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23044c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:00, skipping insertion in model container [2023-11-23 08:53:00,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:00" (3/3) ... [2023-11-23 08:53:00,750 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness_negated.i [2023-11-23 08:53:00,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:53:00,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:53:00,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:53:00,801 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;@37b8f834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:53:00,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:53:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:53:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:00,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:00,813 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:00,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:00,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -187605365, now seen corresponding path program 1 times [2023-11-23 08:53:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110478129] [2023-11-23 08:53:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110478129] [2023-11-23 08:53:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110478129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:53:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797929710] [2023-11-23 08:53:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:01,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:53:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:53:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:53:01,335 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:01,426 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2023-11-23 08:53:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:53:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:01,434 INFO L225 Difference]: With dead ends: 188 [2023-11-23 08:53:01,434 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 08:53:01,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:01,439 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 21 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:01,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 338 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 08:53:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2023-11-23 08:53:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-11-23 08:53:01,472 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 68 [2023-11-23 08:53:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:01,472 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-11-23 08:53:01,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-11-23 08:53:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:01,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:01,475 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:53:01,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:01,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1532137449, now seen corresponding path program 1 times [2023-11-23 08:53:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106251085] [2023-11-23 08:53:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:01,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106251085] [2023-11-23 08:53:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106251085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:53:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301831538] [2023-11-23 08:53:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:01,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:53:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:53:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:53:01,676 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:01,718 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2023-11-23 08:53:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:01,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:53:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:01,720 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:53:01,720 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 08:53:01,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:01,721 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:01,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 332 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 08:53:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2023-11-23 08:53:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2023-11-23 08:53:01,729 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 68 [2023-11-23 08:53:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:01,730 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2023-11-23 08:53:01,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2023-11-23 08:53:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:01,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:01,732 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:01,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:53:01,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:01,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1547656167, now seen corresponding path program 1 times [2023-11-23 08:53:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333455497] [2023-11-23 08:53:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333455497] [2023-11-23 08:53:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333455497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:53:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534567045] [2023-11-23 08:53:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:01,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:53:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:53:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:53:01,898 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:01,937 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2023-11-23 08:53:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:01,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:53:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:01,938 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:53:01,938 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 08:53:01,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:01,940 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:01,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 331 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 08:53:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-23 08:53:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2023-11-23 08:53:01,947 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 68 [2023-11-23 08:53:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:01,948 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2023-11-23 08:53:01,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2023-11-23 08:53:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:01,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:01,950 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:01,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:53:01,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:01,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1900744549, now seen corresponding path program 1 times [2023-11-23 08:53:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268669774] [2023-11-23 08:53:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268669774] [2023-11-23 08:53:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268669774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:53:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525145691] [2023-11-23 08:53:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:02,267 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:02,351 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2023-11-23 08:53:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:53:02,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:53:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:02,355 INFO L225 Difference]: With dead ends: 189 [2023-11-23 08:53:02,355 INFO L226 Difference]: Without dead ends: 94 [2023-11-23 08:53:02,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:02,358 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 406 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-23 08:53:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-23 08:53:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2023-11-23 08:53:02,374 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 68 [2023-11-23 08:53:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:02,375 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2023-11-23 08:53:02,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2023-11-23 08:53:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:02,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:02,376 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:02,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:53:02,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 52547987, now seen corresponding path program 1 times [2023-11-23 08:53:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143829980] [2023-11-23 08:53:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:53:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143829980] [2023-11-23 08:53:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143829980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64999525] [2023-11-23 08:53:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:02,786 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 08:53:02,787 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 08:53:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:02,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-23 08:53:02,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-23 08:53:03,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:03,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:03,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-11-23 08:53:03,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-11-23 08:53:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:03,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64999525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 08:53:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533370374] [2023-11-23 08:53:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:03,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:53:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:53:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:53:03,858 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:04,273 INFO L93 Difference]: Finished difference Result 232 states and 312 transitions. [2023-11-23 08:53:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:53:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:53:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:04,279 INFO L225 Difference]: With dead ends: 232 [2023-11-23 08:53:04,279 INFO L226 Difference]: Without dead ends: 146 [2023-11-23 08:53:04,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:53:04,280 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 68 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:04,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 398 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:53:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-23 08:53:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-11-23 08:53:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 97 states have (on average 1.268041237113402) internal successors, (123), 99 states have internal predecessors, (123), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 08:53:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2023-11-23 08:53:04,291 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 68 [2023-11-23 08:53:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:04,292 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2023-11-23 08:53:04,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2023-11-23 08:53:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:53:04,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:04,295 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:04,312 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 08:53:04,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:04,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:04,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 429987315, now seen corresponding path program 1 times [2023-11-23 08:53:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153869745] [2023-11-23 08:53:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:53:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:53:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:53:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:53:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:53:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:53:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153869745] [2023-11-23 08:53:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153869745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110986219] [2023-11-23 08:53:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:04,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:04,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:04,788 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 08:53:04,813 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 08:53:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:04,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-23 08:53:04,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:05,005 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:05,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-11-23 08:53:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:53:05,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:53:05,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:53:05,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:53:05,205 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:05,205 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 1 case distinctions, treesize of input 34 treesize of output 29 [2023-11-23 08:53:05,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-23 08:53:05,247 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:05,247 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 1 case distinctions, treesize of input 27 treesize of output 24 [2023-11-23 08:53:05,263 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 15 treesize of output 7 [2023-11-23 08:53:05,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:53:05,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-23 08:53:05,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,393 INFO L349 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2023-11-23 08:53:05,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 80 [2023-11-23 08:53:05,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 08:53:05,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 08:53:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:06,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:06,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_587 Int) (v_ArrVal_586 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_586))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_587))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 08:53:06,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:06,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 08:53:06,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-23 08:53:06,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:06,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:06,550 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:53:06,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 315 treesize of output 302 [2023-11-23 08:53:06,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:06,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:06,621 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:53:06,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 259 treesize of output 288 [2023-11-23 08:53:06,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:06,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 304 [2023-11-23 08:53:06,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 260 [2023-11-23 08:53:06,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:06,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 348 [2023-11-23 08:53:06,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 307 treesize of output 295 [2023-11-23 08:53:07,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2023-11-23 08:53:07,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2023-11-23 08:53:08,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:08,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:08,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:08,099 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 491 treesize of output 485 [2023-11-23 08:53:09,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:09,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 594 treesize of output 568 [2023-11-23 08:53:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110986219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:13,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2023-11-23 08:53:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674637887] [2023-11-23 08:53:13,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:53:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:53:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=327, Unknown=2, NotChecked=36, Total=420 [2023-11-23 08:53:13,830 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-23 08:53:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:15,126 INFO L93 Difference]: Finished difference Result 310 states and 416 transitions. [2023-11-23 08:53:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 08:53:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 69 [2023-11-23 08:53:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:15,128 INFO L225 Difference]: With dead ends: 310 [2023-11-23 08:53:15,128 INFO L226 Difference]: Without dead ends: 189 [2023-11-23 08:53:15,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=105, Invalid=653, Unknown=2, NotChecked=52, Total=812 [2023-11-23 08:53:15,129 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 68 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:15,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1279 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 08:53:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-23 08:53:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 143. [2023-11-23 08:53:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 97 states have internal predecessors, (118), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (37), 33 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:53:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2023-11-23 08:53:15,139 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 191 transitions. Word has length 69 [2023-11-23 08:53:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:15,140 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 191 transitions. [2023-11-23 08:53:15,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-23 08:53:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 191 transitions. [2023-11-23 08:53:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:15,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:15,141 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:15,158 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 08:53:15,354 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,SelfDestructingSolverStorable5 [2023-11-23 08:53:15,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:15,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1019656681, now seen corresponding path program 1 times [2023-11-23 08:53:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978346850] [2023-11-23 08:53:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:53:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:53:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:15,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:15,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978346850] [2023-11-23 08:53:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978346850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:15,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:53:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920574532] [2023-11-23 08:53:15,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:15,640 INFO L87 Difference]: Start difference. First operand 143 states and 191 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:15,754 INFO L93 Difference]: Finished difference Result 251 states and 339 transitions. [2023-11-23 08:53:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2023-11-23 08:53:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:15,757 INFO L225 Difference]: With dead ends: 251 [2023-11-23 08:53:15,757 INFO L226 Difference]: Without dead ends: 143 [2023-11-23 08:53:15,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:53:15,758 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 34 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:15,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 548 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-23 08:53:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-23 08:53:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 97 states have internal predecessors, (116), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (37), 33 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:53:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2023-11-23 08:53:15,772 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 189 transitions. Word has length 70 [2023-11-23 08:53:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:15,773 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 189 transitions. [2023-11-23 08:53:15,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2023-11-23 08:53:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 08:53:15,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:15,778 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:53:15,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:53:15,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:15,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 147686538, now seen corresponding path program 1 times [2023-11-23 08:53:15,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:15,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079495304] [2023-11-23 08:53:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:53:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:53:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:53:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:53:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-23 08:53:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079495304] [2023-11-23 08:53:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079495304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:16,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269800468] [2023-11-23 08:53:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:16,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:16,040 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:16,106 INFO L93 Difference]: Finished difference Result 258 states and 345 transitions. [2023-11-23 08:53:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2023-11-23 08:53:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:16,108 INFO L225 Difference]: With dead ends: 258 [2023-11-23 08:53:16,108 INFO L226 Difference]: Without dead ends: 149 [2023-11-23 08:53:16,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:16,110 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 15 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:16,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 391 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-23 08:53:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2023-11-23 08:53:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 99 states have internal predecessors, (118), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (37), 33 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:53:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2023-11-23 08:53:16,129 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 74 [2023-11-23 08:53:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2023-11-23 08:53:16,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2023-11-23 08:53:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:53:16,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:16,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:16,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:53:16,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:16,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1486035332, now seen corresponding path program 1 times [2023-11-23 08:53:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021083148] [2023-11-23 08:53:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:53:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:53:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:53:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:53:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:53:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021083148] [2023-11-23 08:53:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021083148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:16,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:16,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:16,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839749708] [2023-11-23 08:53:16,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:16,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:16,308 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:16,375 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2023-11-23 08:53:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 08:53:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:16,376 INFO L225 Difference]: With dead ends: 263 [2023-11-23 08:53:16,376 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 08:53:16,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:16,377 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:16,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 396 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 08:53:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2023-11-23 08:53:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 101 states have internal predecessors, (120), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (37), 33 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:53:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2023-11-23 08:53:16,387 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 73 [2023-11-23 08:53:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:16,387 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2023-11-23 08:53:16,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2023-11-23 08:53:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:53:16,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:16,388 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:53:16,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:53:16,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:16,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1961596280, now seen corresponding path program 1 times [2023-11-23 08:53:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050839462] [2023-11-23 08:53:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:53:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:53:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:53:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:53:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:53:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050839462] [2023-11-23 08:53:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050839462] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309856802] [2023-11-23 08:53:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:16,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:16,605 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 08:53:16,606 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 08:53:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-23 08:53:16,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:16,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-23 08:53:16,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:16,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:17,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:17,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309856802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:17,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:17,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2023-11-23 08:53:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099129164] [2023-11-23 08:53:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:17,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:53:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:53:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:53:17,694 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:53:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:18,824 INFO L93 Difference]: Finished difference Result 298 states and 390 transitions. [2023-11-23 08:53:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 08:53:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 80 [2023-11-23 08:53:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:18,827 INFO L225 Difference]: With dead ends: 298 [2023-11-23 08:53:18,827 INFO L226 Difference]: Without dead ends: 201 [2023-11-23 08:53:18,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:53:18,836 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:18,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 885 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 08:53:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-23 08:53:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2023-11-23 08:53:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 124 states have (on average 1.217741935483871) internal successors, (151), 129 states have internal predecessors, (151), 39 states have call successors, (39), 14 states have call predecessors, (39), 15 states have return successors, (42), 35 states have call predecessors, (42), 38 states have call successors, (42) [2023-11-23 08:53:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 232 transitions. [2023-11-23 08:53:18,862 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 232 transitions. Word has length 80 [2023-11-23 08:53:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:18,862 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 232 transitions. [2023-11-23 08:53:18,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:53:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 232 transitions. [2023-11-23 08:53:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:53:18,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:18,865 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:53:18,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 08:53:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:19,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:19,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1348608376, now seen corresponding path program 1 times [2023-11-23 08:53:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030281752] [2023-11-23 08:53:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:53:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:53:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:53:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:53:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:53:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:53:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:53:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030281752] [2023-11-23 08:53:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030281752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38916296] [2023-11-23 08:53:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:19,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:19,396 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 08:53:19,412 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 08:53:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-23 08:53:19,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:19,659 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:19,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-11-23 08:53:19,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:53:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-23 08:53:19,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-23 08:53:19,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,941 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-23 08:53:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 74 [2023-11-23 08:53:19,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,963 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-23 08:53:19,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 76 [2023-11-23 08:53:19,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,984 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-23 08:53:19,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-23 08:53:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:19,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2023-11-23 08:53:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-23 08:53:20,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,184 INFO L349 Elim1Store]: treesize reduction 196, result has 12.9 percent of original size [2023-11-23 08:53:20,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 193 treesize of output 103 [2023-11-23 08:53:20,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:20,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2023-11-23 08:53:20,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2023-11-23 08:53:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:21,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:22,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1191 Int)) (= (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1190))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 v_ArrVal_1191))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 8))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1191 Int)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|))) (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1190))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 v_ArrVal_1191))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 8)) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)))) is different from false [2023-11-23 08:53:22,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:22,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 254 [2023-11-23 08:53:22,773 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 08:53:22,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-23 08:53:23,031 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:23,350 INFO L349 Elim1Store]: treesize reduction 78, result has 52.7 percent of original size [2023-11-23 08:53:23,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 509 treesize of output 448 [2023-11-23 08:53:23,372 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:23,549 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2023-11-23 08:53:23,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 268 [2023-11-23 08:53:24,168 INFO L349 Elim1Store]: treesize reduction 320, result has 39.0 percent of original size [2023-11-23 08:53:24,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 6073 treesize of output 5095 [2023-11-23 08:53:24,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:24,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9852599 treesize of output 9758787 [2023-11-23 08:53:27,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28618 treesize of output 27722 [2023-11-23 08:53:28,740 INFO L349 Elim1Store]: treesize reduction 252, result has 60.4 percent of original size [2023-11-23 08:53:28,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 32963 treesize of output 30232 [2023-11-23 08:53:31,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:31,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 45441 treesize of output 41141 [2023-11-23 08:53:33,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:33,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 23404 treesize of output 23373 [2023-11-23 08:53:34,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:34,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24067 treesize of output 23993 [2023-11-23 08:56:50,651 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-23 08:56:50,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-23 08:56:50,653 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 08:56:50,666 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 08:56:50,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:56:50,867 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-23 08:56:50,872 INFO L158 Benchmark]: Toolchain (without parser) took 232376.55ms. Allocated memory was 155.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 123.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 08:56:50,873 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:56:50,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1517.24ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 122.3MB in the beginning and 96.5MB in the end (delta: 25.8MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2023-11-23 08:56:50,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.48ms. Allocated memory is still 197.1MB. Free memory was 96.5MB in the beginning and 90.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:56:50,873 INFO L158 Benchmark]: Boogie Preprocessor took 51.61ms. Allocated memory is still 197.1MB. Free memory was 90.2MB in the beginning and 87.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 08:56:50,873 INFO L158 Benchmark]: RCFGBuilder took 570.87ms. Allocated memory is still 197.1MB. Free memory was 87.1MB in the beginning and 132.4MB in the end (delta: -45.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2023-11-23 08:56:50,874 INFO L158 Benchmark]: TraceAbstraction took 230126.19ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 131.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 08:56:50,875 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1517.24ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 122.3MB in the beginning and 96.5MB in the end (delta: 25.8MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.48ms. Allocated memory is still 197.1MB. Free memory was 96.5MB in the beginning and 90.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.61ms. Allocated memory is still 197.1MB. Free memory was 90.2MB in the beginning and 87.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.87ms. Allocated memory is still 197.1MB. Free memory was 87.1MB in the beginning and 132.4MB in the end (delta: -45.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 230126.19ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 131.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_linked_list_push_back_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 039075241b3e03e605f8b837c5703607fb327de3ebb7fe9349592ff866b009f9 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:56:53,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:56:53,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 08:56:53,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:56:53,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:56:53,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:56:53,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:56:53,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:56:53,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:56:53,312 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:56:53,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:56:53,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:56:53,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:56:53,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:56:53,314 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:56:53,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:56:53,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:56:53,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:56:53,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:56:53,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:56:53,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:56:53,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 08:56:53,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 08:56:53,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 08:56:53,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:56:53,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:56:53,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:56:53,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:56:53,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:56:53,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:56:53,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:56:53,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:56:53,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:56:53,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:56:53,320 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 08:56:53,320 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 08:56:53,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:56:53,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:56:53,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:56:53,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:56:53,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:56:53,322 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 08:56:53,322 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 -> 039075241b3e03e605f8b837c5703607fb327de3ebb7fe9349592ff866b009f9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:56:53,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:56:53,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:56:53,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:56:53,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:56:53,614 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:56:53,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness_negated.i [2023-11-23 08:56:54,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:56:55,060 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:56:55,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness_negated.i [2023-11-23 08:56:55,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e401246/051823dfbe4643b9be6588139ce2cec5/FLAG722cce1a0 [2023-11-23 08:56:55,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e401246/051823dfbe4643b9be6588139ce2cec5 [2023-11-23 08:56:55,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:56:55,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:56:55,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:56:55,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:56:55,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:56:55,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:55" (1/1) ... [2023-11-23 08:56:55,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c920faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:55, skipping insertion in model container [2023-11-23 08:56:55,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:55" (1/1) ... [2023-11-23 08:56:55,167 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:56:55,387 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_linked_list_push_back_harness_negated.i[4499,4512] [2023-11-23 08:56:55,393 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_linked_list_push_back_harness_negated.i[4559,4572] [2023-11-23 08:56:56,142 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,144 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,144 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,145 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,162 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,164 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,422 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:56:56,423 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:56:56,423 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:56:56,424 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:56:56,426 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:56:56,426 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:56:56,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:56:56,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:56:56,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:56:56,431 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:56:56,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:56:56,575 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 08:56:56,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:56:56,609 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_linked_list_push_back_harness_negated.i[4499,4512] [2023-11-23 08:56:56,610 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_linked_list_push_back_harness_negated.i[4559,4572] [2023-11-23 08:56:56,655 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,655 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,656 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,656 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,656 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,666 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,666 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,667 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,667 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,668 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,668 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,668 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,668 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,686 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:56:56,687 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:56:56,687 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:56:56,688 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:56:56,688 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:56:56,688 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:56:56,689 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:56:56,689 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:56:56,689 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:56:56,690 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:56:56,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:56:56,726 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:56:56,740 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_linked_list_push_back_harness_negated.i[4499,4512] [2023-11-23 08:56:56,741 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_linked_list_push_back_harness_negated.i[4559,4572] [2023-11-23 08:56:56,757 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,764 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,764 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,765 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,770 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:56:56,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:56:56,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:56:56,837 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:56:56,837 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:56:56,838 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:56:56,838 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:56:56,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:56:56,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:56:56,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:56:56,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:56:56,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:56:57,082 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,083 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,084 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,085 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:56:57,090 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:56:57,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57 WrapperNode [2023-11-23 08:56:57,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:56:57,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:56:57,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:56:57,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:56:57,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,185 INFO L138 Inliner]: procedures = 697, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 150 [2023-11-23 08:56:57,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:56:57,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:56:57,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:56:57,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:56:57,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:56:57,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:56:57,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:56:57,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:56:57,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (1/1) ... [2023-11-23 08:56:57,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:56:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:56:57,285 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 08:56:57,372 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 08:56:57,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:56:57,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 08:56:57,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:56:57,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:56:57,392 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:56:57,392 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:56:57,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:56:57,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:56:57,393 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:56:57,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:56:57,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:56:57,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:56:57,394 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:56:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:56:57,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:56:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:56:57,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:56:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:56:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:56:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:56:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:56:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:56:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:56:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:56:57,644 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:56:57,645 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:56:58,028 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:56:58,073 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:56:58,074 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:56:58,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:58 BoogieIcfgContainer [2023-11-23 08:56:58,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:56:58,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:56:58,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:56:58,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:56:58,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:56:55" (1/3) ... [2023-11-23 08:56:58,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537c6dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:58, skipping insertion in model container [2023-11-23 08:56:58,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:57" (2/3) ... [2023-11-23 08:56:58,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537c6dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:58, skipping insertion in model container [2023-11-23 08:56:58,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:58" (3/3) ... [2023-11-23 08:56:58,080 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness_negated.i [2023-11-23 08:56:58,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:56:58,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:56:58,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:56:58,133 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;@437029d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:56:58,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:56:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:56:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:56:58,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:58,151 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:56:58,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:58,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -187605365, now seen corresponding path program 1 times [2023-11-23 08:56:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:56:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624611264] [2023-11-23 08:56:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:56:58,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:56:58,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 08:56:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:58,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:56:58,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:56:58,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:56:58,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:56:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624611264] [2023-11-23 08:56:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624611264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:56:58,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:56:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:56:58,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760887618] [2023-11-23 08:56:58,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:56:58,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:56:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:56:58,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:56:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:56:58,499 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:56:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:58,563 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2023-11-23 08:56:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:56:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:56:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:58,572 INFO L225 Difference]: With dead ends: 176 [2023-11-23 08:56:58,572 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 08:56:58,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:56:58,578 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:58,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:56:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 08:56:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-23 08:56:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:56:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-11-23 08:56:58,646 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 68 [2023-11-23 08:56:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:58,647 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-11-23 08:56:58,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:56:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-11-23 08:56:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:56:58,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:58,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:56:58,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:58,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:58,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:58,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 496448661, now seen corresponding path program 1 times [2023-11-23 08:56:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:56:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890468634] [2023-11-23 08:56:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:56:58,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:56:58,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 08:56:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:59,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:56:59,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:56:59,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:56:59,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:56:59,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890468634] [2023-11-23 08:56:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890468634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:56:59,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:56:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:56:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751053429] [2023-11-23 08:56:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:56:59,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:56:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:56:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:56:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:56:59,241 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:56:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:59,380 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2023-11-23 08:56:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:56:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:56:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:59,384 INFO L225 Difference]: With dead ends: 184 [2023-11-23 08:56:59,384 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 08:56:59,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:56:59,388 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 25 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:59,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 522 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:56:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 08:56:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-23 08:56:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:56:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2023-11-23 08:56:59,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 68 [2023-11-23 08:56:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:59,405 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2023-11-23 08:56:59,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:56:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2023-11-23 08:56:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:56:59,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:59,408 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:56:59,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:59,618 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:59,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash 52547987, now seen corresponding path program 1 times [2023-11-23 08:56:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:56:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913185634] [2023-11-23 08:56:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:59,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:59,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:56:59,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:56:59,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 08:56:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:59,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 08:56:59,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:56:59,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:56:59,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:56:59,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913185634] [2023-11-23 08:56:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913185634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:56:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:56:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:56:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133357580] [2023-11-23 08:56:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:56:59,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:56:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:56:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:56:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:56:59,845 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:56:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:59,996 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2023-11-23 08:56:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:56:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:56:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:59,999 INFO L225 Difference]: With dead ends: 170 [2023-11-23 08:56:59,999 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:57:00,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:57:00,000 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:00,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 523 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:57:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:57:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 08:57:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:57:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-11-23 08:57:00,009 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 68 [2023-11-23 08:57:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:00,010 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-11-23 08:57:00,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-11-23 08:57:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:57:00,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:00,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:00,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:00,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:00,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1019656681, now seen corresponding path program 1 times [2023-11-23 08:57:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:00,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332210250] [2023-11-23 08:57:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:00,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:00,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 08:57:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:00,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:57:00,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:57:00,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:00,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332210250] [2023-11-23 08:57:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332210250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:57:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650391124] [2023-11-23 08:57:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:00,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:57:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:57:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:57:00,556 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:00,895 INFO L93 Difference]: Finished difference Result 175 states and 242 transitions. [2023-11-23 08:57:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:57:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2023-11-23 08:57:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:00,897 INFO L225 Difference]: With dead ends: 175 [2023-11-23 08:57:00,897 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:57:00,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:57:00,898 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:00,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 543 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:57:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:57:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 08:57:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 56 states have internal predecessors, (67), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:57:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2023-11-23 08:57:00,905 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 70 [2023-11-23 08:57:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:00,905 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2023-11-23 08:57:00,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2023-11-23 08:57:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-23 08:57:00,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:00,910 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:00,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-23 08:57:01,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:01,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:01,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1207240566, now seen corresponding path program 1 times [2023-11-23 08:57:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669254291] [2023-11-23 08:57:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:01,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:01,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:01,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 08:57:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:01,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:57:01,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:57:01,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:01,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669254291] [2023-11-23 08:57:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669254291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:57:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406058435] [2023-11-23 08:57:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:01,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:57:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:57:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:57:01,445 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:01,732 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2023-11-23 08:57:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:57:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2023-11-23 08:57:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:01,734 INFO L225 Difference]: With dead ends: 182 [2023-11-23 08:57:01,734 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 08:57:01,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:57:01,735 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:01,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 624 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:57:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 08:57:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-23 08:57:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:57:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2023-11-23 08:57:01,743 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 72 [2023-11-23 08:57:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:01,743 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2023-11-23 08:57:01,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2023-11-23 08:57:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:57:01,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:01,744 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:01,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:01,945 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:01,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1486035332, now seen corresponding path program 1 times [2023-11-23 08:57:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375396340] [2023-11-23 08:57:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:01,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:01,957 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:01,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 08:57:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:57:02,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:57:02,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:02,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375396340] [2023-11-23 08:57:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375396340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:02,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:57:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000944652] [2023-11-23 08:57:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:02,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:57:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:57:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:57:02,249 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:02,492 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2023-11-23 08:57:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:57:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 08:57:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:02,494 INFO L225 Difference]: With dead ends: 178 [2023-11-23 08:57:02,494 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 08:57:02,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:57:02,495 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:02,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 529 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:57:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 08:57:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2023-11-23 08:57:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 58 states have internal predecessors, (69), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:57:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2023-11-23 08:57:02,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 73 [2023-11-23 08:57:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:02,502 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2023-11-23 08:57:02,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:57:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2023-11-23 08:57:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:57:02,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:02,508 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:02,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:02,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:02,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:02,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1961596280, now seen corresponding path program 1 times [2023-11-23 08:57:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638110658] [2023-11-23 08:57:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:02,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-23 08:57:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:57:02,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:57:02,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:02,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638110658] [2023-11-23 08:57:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638110658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:57:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753968318] [2023-11-23 08:57:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:02,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:57:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:57:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:57:02,965 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:57:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:03,168 INFO L93 Difference]: Finished difference Result 179 states and 244 transitions. [2023-11-23 08:57:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:57:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 80 [2023-11-23 08:57:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:03,185 INFO L225 Difference]: With dead ends: 179 [2023-11-23 08:57:03,185 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 08:57:03,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:57:03,186 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:03,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:57:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 08:57:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-11-23 08:57:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 59 states have internal predecessors, (70), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:57:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2023-11-23 08:57:03,193 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 80 [2023-11-23 08:57:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:03,193 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2023-11-23 08:57:03,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:57:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2023-11-23 08:57:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:57:03,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:03,194 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:03,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:03,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:03,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash -966331477, now seen corresponding path program 1 times [2023-11-23 08:57:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526182449] [2023-11-23 08:57:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:03,403 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:03,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-23 08:57:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-23 08:57:03,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:05,914 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2023-11-23 08:57:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:57:06,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:57:06,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526182449] [2023-11-23 08:57:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526182449] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:57:06,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:57:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-23 08:57:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410490553] [2023-11-23 08:57:06,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:57:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:57:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:57:06,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2023-11-23 08:57:06,359 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 08:57:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:07,742 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2023-11-23 08:57:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:57:07,743 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2023-11-23 08:57:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:07,744 INFO L225 Difference]: With dead ends: 239 [2023-11-23 08:57:07,744 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 08:57:07,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=111, Invalid=354, Unknown=1, NotChecked=40, Total=506 [2023-11-23 08:57:07,745 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 207 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:07,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 787 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 379 Invalid, 0 Unknown, 301 Unchecked, 1.0s Time] [2023-11-23 08:57:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 08:57:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 111. [2023-11-23 08:57:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 74 states have internal predecessors, (91), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:57:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2023-11-23 08:57:07,755 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 82 [2023-11-23 08:57:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:07,755 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2023-11-23 08:57:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 08:57:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2023-11-23 08:57:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:57:07,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:07,756 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:07,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:07,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:07,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:07,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1642455981, now seen corresponding path program 1 times [2023-11-23 08:57:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139454257] [2023-11-23 08:57:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:07,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:07,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:07,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-23 08:57:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:08,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:57:08,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:57:08,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:08,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:08,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139454257] [2023-11-23 08:57:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139454257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:57:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351475420] [2023-11-23 08:57:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:08,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:57:08,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:08,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:57:08,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:08,172 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:57:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:08,319 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2023-11-23 08:57:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:57:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-11-23 08:57:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:08,322 INFO L225 Difference]: With dead ends: 215 [2023-11-23 08:57:08,322 INFO L226 Difference]: Without dead ends: 114 [2023-11-23 08:57:08,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:57:08,324 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 8 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:08,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:57:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-23 08:57:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2023-11-23 08:57:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.25) internal successors, (90), 74 states have internal predecessors, (90), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:57:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 150 transitions. [2023-11-23 08:57:08,345 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 150 transitions. Word has length 82 [2023-11-23 08:57:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:08,346 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 150 transitions. [2023-11-23 08:57:08,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:57:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 150 transitions. [2023-11-23 08:57:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:57:08,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:08,347 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-23 08:57:08,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-23 08:57:08,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:08,554 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:08,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1225059375, now seen corresponding path program 1 times [2023-11-23 08:57:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:08,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903409807] [2023-11-23 08:57:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:08,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:08,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:08,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:08,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-23 08:57:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:08,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 08:57:08,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:57:08,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:08,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:57:08,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903409807] [2023-11-23 08:57:08,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903409807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:08,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:57:08,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:57:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014205841] [2023-11-23 08:57:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:08,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:57:08,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:57:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:57:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:57:08,782 INFO L87 Difference]: Start difference. First operand 111 states and 150 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:57:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:08,904 INFO L93 Difference]: Finished difference Result 213 states and 296 transitions. [2023-11-23 08:57:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:57:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-11-23 08:57:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:08,907 INFO L225 Difference]: With dead ends: 213 [2023-11-23 08:57:08,907 INFO L226 Difference]: Without dead ends: 112 [2023-11-23 08:57:08,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:57:08,908 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 6 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:08,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:57:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-23 08:57:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-11-23 08:57:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 71 states have internal predecessors, (85), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:57:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2023-11-23 08:57:08,919 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 82 [2023-11-23 08:57:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:08,920 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2023-11-23 08:57:08,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:57:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2023-11-23 08:57:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:57:08,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:08,921 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:57:08,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:09,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:09,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:09,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 364282499, now seen corresponding path program 1 times [2023-11-23 08:57:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:57:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711867314] [2023-11-23 08:57:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:57:09,132 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:57:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 08:57:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:57:09,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 08:57:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:57:09,774 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-23 08:57:09,774 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 08:57:09,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:57:09,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:57:09,979 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:09,982 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:57:10,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret545 could not be translated [2023-11-23 08:57:10,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 08:57:10,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem300 [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short303 could not be translated [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem300 [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem302 [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 08:57:10,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 08:57:10,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem308 [2023-11-23 08:57:10,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 08:57:10,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 08:57:10,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short309 could not be translated [2023-11-23 08:57:10,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 08:57:10,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret315 could not be translated [2023-11-23 08:57:10,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated [2023-11-23 08:57:10,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated [2023-11-23 08:57:10,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem312 [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem313 [2023-11-23 08:57:10,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated [2023-11-23 08:57:10,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated [2023-11-23 08:57:10,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated [2023-11-23 08:57:10,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem313 [2023-11-23 08:57:10,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem312 [2023-11-23 08:57:10,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret371 could not be translated [2023-11-23 08:57:10,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:57:10 BoogieIcfgContainer [2023-11-23 08:57:10,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:57:10,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:57:10,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:57:10,049 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:57:10,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:58" (3/4) ... [2023-11-23 08:57:10,050 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 08:57:10,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret545 could not be translated [2023-11-23 08:57:10,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 08:57:10,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,071 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem300 [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem298 [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short303 could not be translated [2023-11-23 08:57:10,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem300 [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem296 [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem302 [2023-11-23 08:57:10,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 08:57:10,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 08:57:10,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem308 [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short309 could not be translated [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret315 could not be translated [2023-11-23 08:57:10,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem312 [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated [2023-11-23 08:57:10,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem313 [2023-11-23 08:57:10,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated [2023-11-23 08:57:10,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated [2023-11-23 08:57:10,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem310 [2023-11-23 08:57:10,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem312 [2023-11-23 08:57:10,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem313 [2023-11-23 08:57:10,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated [2023-11-23 08:57:10,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated [2023-11-23 08:57:10,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret371 could not be translated [2023-11-23 08:57:10,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:57:10,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:57:10,129 INFO L158 Benchmark]: Toolchain (without parser) took 15031.88ms. Allocated memory was 75.5MB in the beginning and 216.0MB in the end (delta: 140.5MB). Free memory was 52.3MB in the beginning and 113.9MB in the end (delta: -61.6MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,129 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:57:10,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1993.57ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 52.0MB in the beginning and 48.5MB in the end (delta: 3.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.97ms. Allocated memory is still 115.3MB. Free memory was 48.5MB in the beginning and 42.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,129 INFO L158 Benchmark]: Boogie Preprocessor took 73.90ms. Allocated memory is still 115.3MB. Free memory was 42.2MB in the beginning and 38.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,130 INFO L158 Benchmark]: RCFGBuilder took 813.65ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 38.0MB in the beginning and 87.1MB in the end (delta: -49.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,130 INFO L158 Benchmark]: TraceAbstraction took 11972.41ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 86.1MB in the beginning and 121.2MB in the end (delta: -35.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,130 INFO L158 Benchmark]: Witness Printer took 79.75ms. Allocated memory is still 216.0MB. Free memory was 121.2MB in the beginning and 113.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 08:57:10,131 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1993.57ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 52.0MB in the beginning and 48.5MB in the end (delta: 3.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.97ms. Allocated memory is still 115.3MB. Free memory was 48.5MB in the beginning and 42.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.90ms. Allocated memory is still 115.3MB. Free memory was 42.2MB in the beginning and 38.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 813.65ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 38.0MB in the beginning and 87.1MB in the end (delta: -49.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11972.41ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 86.1MB in the beginning and 121.2MB in the end (delta: -35.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 79.75ms. Allocated memory is still 216.0MB. Free memory was 121.2MB in the beginning and 113.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret545 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem300 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short303 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem300 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem302 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem308 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short309 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem312 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem313 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem313 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem312 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret371 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret545 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem300 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem298 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short303 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short297 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem300 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short301 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short299 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem296 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem302 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem308 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short309 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret384 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem312 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem313 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret368 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem312 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem313 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short311 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short314 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret371 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; [L7362] CALL aws_linked_list_push_back_harness() [L7344] struct aws_linked_list list; [L7345] struct aws_linked_list_node to_add; [L7347] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [\old(max_length)=20, list={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6744] RET assume_abort_if_not(length <= max_length) VAL [\old(max_length)=20, length=0, list={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [\old(max_length)=20, curr={7:0}, i=0, length=0, list={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [\old(max_length)=20, curr={7:0}, i=0, length=0, list={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr [L7347] RET ensure_linked_list_is_allocated(&list, 20) [L7350] EXPR list.tail.prev [L7350] struct aws_linked_list_node *old_last = list.tail.prev; [L7353] CALL aws_linked_list_push_back(&list, &to_add) [L4943] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4943] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, list={7:0}, node={5:0}, node={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4943] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4943] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={7:0}, list={7:0}, node={5:0}, node={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4944-L4946] CALL assume_abort_if_not((node != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4944-L4946] RET assume_abort_if_not((node != ((void *)0) )) VAL [list={7:0}, list={7:0}, node={5:0}, node={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4947] CALL aws_linked_list_insert_before(&list->tail, node) VAL [before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}] [L4912] CALL, EXPR aws_linked_list_node_prev_is_valid(before) VAL [node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] EXPR node && node->prev [L4729] EXPR node->prev [L4729] EXPR node && node->prev VAL [node={7:16}, node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] EXPR node && node->prev && node->prev->next == node [L4729] EXPR node->prev [L4729] EXPR node->prev->next [L4729] EXPR node && node->prev && node->prev->next == node VAL [node={7:16}, node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] return node && node->prev && node->prev->next == node; [L4912] RET, EXPR aws_linked_list_node_prev_is_valid(before) VAL [before={7:16}, before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}, to_add={5:0}] [L4912] CALL assume_abort_if_not((aws_linked_list_node_prev_is_valid(before))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4912] RET assume_abort_if_not((aws_linked_list_node_prev_is_valid(before))) VAL [before={7:16}, before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}, to_add={5:0}] [L4913-L4915] CALL assume_abort_if_not((to_add != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4913-L4915] RET assume_abort_if_not((to_add != ((void *)0) )) VAL [before={7:16}, before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}, to_add={5:0}] [L4916] to_add->next = before [L4917] EXPR before->prev [L4917] to_add->prev = before->prev [L4918] EXPR before->prev [L4918] before->prev->next = to_add [L4919] before->prev = to_add VAL [before={7:16}, before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}, to_add={5:0}] [L4920] CALL, EXPR aws_linked_list_node_prev_is_valid(before) VAL [node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] EXPR node && node->prev [L4729] EXPR node->prev [L4729] EXPR node && node->prev VAL [node={7:16}, node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] EXPR node && node->prev && node->prev->next == node [L4729] EXPR node->prev [L4729] EXPR node->prev->next [L4729] EXPR node && node->prev && node->prev->next == node VAL [node={7:16}, node={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4729] return node && node->prev && node->prev->next == node; [L4920] RET, EXPR aws_linked_list_node_prev_is_valid(before) VAL [before={7:16}, before={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0, to_add={5:0}, to_add={5:0}] [L4920] CALL __VERIFIER_assert(!((aws_linked_list_node_prev_is_valid(before)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 5049 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 301 IncrementalHoareTripleChecker+Unchecked, 3952 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1139 IncrementalHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1097 mSDtfsCounter, 1139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 767 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 816 ConstructedInterpolants, 7 QuantifiedInterpolants, 1675 SizeOfPredicates, 37 NumberOfNonLiveVariables, 2706 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 508/510 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 08:57:10,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE