./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b8488bc4b38d88c79bc520e9824284003ed2f71ce856a53cf11e7fc61dbeef4b --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:46:50,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:46:50,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:46:50,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:46:50,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:46:50,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:46:50,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:46:50,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:46:50,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:46:50,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:46:50,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:46:50,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:46:50,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:46:50,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:46:50,376 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:46:50,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:46:50,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:46:50,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:46:50,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:46:50,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:46:50,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:46:50,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:46:50,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:46:50,378 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:46:50,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:46:50,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:46:50,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:46:50,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:46:50,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:46:50,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:46:50,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:46:50,382 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:46:50,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:46:50,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:46:50,382 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 -> b8488bc4b38d88c79bc520e9824284003ed2f71ce856a53cf11e7fc61dbeef4b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:46:50,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:46:50,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:46:50,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:46:50,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:46:50,626 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:46:50,628 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_begin_harness.i [2023-11-23 08:46:51,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:46:52,208 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:46:52,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness.i [2023-11-23 08:46:52,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50320c626/458e6d274c33403c83def7fc5902c067/FLAGcbcbf0a5c [2023-11-23 08:46:52,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50320c626/458e6d274c33403c83def7fc5902c067 [2023-11-23 08:46:52,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:46:52,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:46:52,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:46:52,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:46:52,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:46:52,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:52" (1/1) ... [2023-11-23 08:46:52,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7560d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:52, skipping insertion in model container [2023-11-23 08:46:52,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:52" (1/1) ... [2023-11-23 08:46:52,347 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:46:52,580 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_begin_harness.i[4495,4508] [2023-11-23 08:46:52,586 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_begin_harness.i[4555,4568] [2023-11-23 08:46:53,117 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,119 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,119 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,122 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,122 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,139 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,140 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,141 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,141 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,142 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,373 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:46:53,374 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:46:53,375 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:46:53,377 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:46:53,377 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:46:53,378 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:46:53,378 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:46:53,379 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:46:53,379 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:46:53,383 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:46:53,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:46:53,515 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:46:53,528 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_begin_harness.i[4495,4508] [2023-11-23 08:46:53,528 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_begin_harness.i[4555,4568] [2023-11-23 08:46:53,577 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,578 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,578 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,578 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,579 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,591 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,591 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,592 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,592 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,593 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,593 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:46:53,632 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:46:53,632 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:46:53,633 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:46:53,633 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:46:53,634 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:46:53,634 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:46:53,634 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:46:53,640 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:46:53,641 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:46:53,641 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:46:53,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:46:53,882 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,882 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,882 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,882 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,882 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,883 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,884 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,884 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,884 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:46:53,890 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:46:53,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53 WrapperNode [2023-11-23 08:46:53,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:46:53,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:46:53,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:46:53,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:46:53,899 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:46:53" (1/1) ... [2023-11-23 08:46:53,961 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:46:53" (1/1) ... [2023-11-23 08:46:54,005 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-23 08:46:54,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:46:54,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:46:54,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:46:54,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:46:54,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:46:54,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:46:54,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:46:54,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:46:54,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (1/1) ... [2023-11-23 08:46:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:46:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:46:54,108 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:46:54,147 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:46:54,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:46:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:46:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:46:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:46:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:46:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:46:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:46:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:46:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:46:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:46:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:46:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:46:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:46:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:46:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:46:54,359 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:46:54,361 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:46:54,578 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:46:54,615 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:46:54,615 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:46:54,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:54 BoogieIcfgContainer [2023-11-23 08:46:54,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:46:54,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:46:54,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:46:54,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:46:54,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:52" (1/3) ... [2023-11-23 08:46:54,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cb096b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:54, skipping insertion in model container [2023-11-23 08:46:54,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:53" (2/3) ... [2023-11-23 08:46:54,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cb096b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:54, skipping insertion in model container [2023-11-23 08:46:54,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:54" (3/3) ... [2023-11-23 08:46:54,623 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness.i [2023-11-23 08:46:54,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:46:54,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:46:54,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:46:54,673 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;@12cd3add, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:46:54,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:46:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:46:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:46:54,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:46:54,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:46:54,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:46:54,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:46:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 333379415, now seen corresponding path program 1 times [2023-11-23 08:46:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:46:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744768380] [2023-11-23 08:46:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:46:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:46:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:46:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:46:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:46:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:46:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:46:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:46:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:46:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:46:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:46:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744768380] [2023-11-23 08:46:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744768380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:46:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:46:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:46:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918157628] [2023-11-23 08:46:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:46:55,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:46:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:46:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:46:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:46:55,050 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:46:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:46:55,091 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2023-11-23 08:46:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:46:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:46:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:46:55,098 INFO L225 Difference]: With dead ends: 114 [2023-11-23 08:46:55,099 INFO L226 Difference]: Without dead ends: 58 [2023-11-23 08:46:55,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:46:55,114 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:46:55,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:46:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-23 08:46:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-23 08:46:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:46:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2023-11-23 08:46:55,151 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 65 [2023-11-23 08:46:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:46:55,151 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-23 08:46:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:46:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2023-11-23 08:46:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:46:55,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:46:55,159 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:46:55,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:46:55,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:46:55,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:46:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1079899247, now seen corresponding path program 1 times [2023-11-23 08:46:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:46:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220397041] [2023-11-23 08:46:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:46:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:46:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:46:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:46:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:46:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:46:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:46:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:46:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:46:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:46:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:46:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220397041] [2023-11-23 08:46:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220397041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:46:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572346980] [2023-11-23 08:46:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:46:55,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:46:55,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:46:55,638 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:46:55,677 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:46:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:55,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:46:55,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:46:55,874 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:46:55,886 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:46:55,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-11-23 08:46:55,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:55,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2023-11-23 08:46:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:46:56,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:46:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572346980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:46:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:46:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:46:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314319890] [2023-11-23 08:46:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:46:56,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:46:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:46:56,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:46:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:46:56,984 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:46:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:46:57,583 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-23 08:46:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:46:57,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:46:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:46:57,586 INFO L225 Difference]: With dead ends: 160 [2023-11-23 08:46:57,586 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 08:46:57,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:46:57,587 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:46:57,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 362 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:46:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 08:46:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 08:46:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:46:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 08:46:57,606 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 08:46:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:46:57,607 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 08:46:57,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:46:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 08:46:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:46:57,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:46:57,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:46:57,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 08:46:57,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:46:57,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:46:57,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:46:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 418373195, now seen corresponding path program 1 times [2023-11-23 08:46:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:46:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596599851] [2023-11-23 08:46:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:46:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:46:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:46:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:46:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:46:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:46:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:46:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:46:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:46:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:46:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:46:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596599851] [2023-11-23 08:46:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596599851] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:46:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073505492] [2023-11-23 08:46:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:46:58,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:46:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:46:58,093 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:46:58,112 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:46:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:46:58,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:46:58,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:46:58,304 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 20 treesize of output 9 [2023-11-23 08:46:58,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:46:58,309 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 13 treesize of output 1 [2023-11-23 08:46:58,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 08:46:58,330 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 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:47:00,390 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse1 .cse0) .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) is different from true [2023-11-23 08:47:00,943 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2 .cse0))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse4 .cse3) .cse5)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))))) is different from true [2023-11-23 08:47:03,236 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2 .cse0))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse4 .cse3) .cse5)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse6 (select .cse7 .cse8))) (or (and (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse8 .cse6)))) (= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse6))))) is different from true [2023-11-23 08:47:05,076 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) .cse1 .cse0) .cse2))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse5 .cse3))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse7 .cse6) .cse8)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))))) is different from true [2023-11-23 08:47:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 08:47:06,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:47:06,362 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:47:06,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2023-11-23 08:47:06,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:06,370 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 90 treesize of output 92 [2023-11-23 08:47:06,374 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 33 treesize of output 29 [2023-11-23 08:47:06,398 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 41 treesize of output 33 [2023-11-23 08:47:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:47:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073505492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:47:06,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:47:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 08:47:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968961743] [2023-11-23 08:47:06,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:47:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:47:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:47:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=442, Unknown=7, NotChecked=180, Total=702 [2023-11-23 08:47:06,511 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:47:08,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:11,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:15,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:17,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:26,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:28,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:30,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:38,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:40,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:42,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:44,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:46,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:48,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:56,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:47:58,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:00,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:07,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:09,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:09,637 INFO L93 Difference]: Finished difference Result 249 states and 359 transitions. [2023-11-23 08:48:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 08:48:09,638 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 08:48:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:09,640 INFO L225 Difference]: With dead ends: 249 [2023-11-23 08:48:09,640 INFO L226 Difference]: Without dead ends: 138 [2023-11-23 08:48:09,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=169, Invalid=1087, Unknown=20, NotChecked=284, Total=1560 [2023-11-23 08:48:09,644 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 21 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 645 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:09,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 941 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 784 Invalid, 38 Unknown, 645 Unchecked, 40.3s Time] [2023-11-23 08:48:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-23 08:48:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-11-23 08:48:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 82 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (28), 22 states have call predecessors, (28), 22 states have call successors, (28) [2023-11-23 08:48:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-11-23 08:48:09,670 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 65 [2023-11-23 08:48:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:09,670 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-11-23 08:48:09,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:48:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-11-23 08:48:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:48:09,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:09,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:09,685 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:48:09,883 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,SelfDestructingSolverStorable2 [2023-11-23 08:48:09,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:09,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1169700389, now seen corresponding path program 1 times [2023-11-23 08:48:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:09,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564171125] [2023-11-23 08:48:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:48:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:48:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:48:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564171125] [2023-11-23 08:48:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564171125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180558961] [2023-11-23 08:48:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:10,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:10,180 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:48:10,232 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:48:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:48:10,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:10,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180558961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:10,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:48:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542697361] [2023-11-23 08:48:10,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:10,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:10,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:48:10,417 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:10,540 INFO L93 Difference]: Finished difference Result 221 states and 306 transitions. [2023-11-23 08:48:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:48:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 08:48:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:10,547 INFO L225 Difference]: With dead ends: 221 [2023-11-23 08:48:10,547 INFO L226 Difference]: Without dead ends: 120 [2023-11-23 08:48:10,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:48:10,550 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:10,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 236 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-23 08:48:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-23 08:48:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 88 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:48:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2023-11-23 08:48:10,571 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 67 [2023-11-23 08:48:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:10,572 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2023-11-23 08:48:10,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2023-11-23 08:48:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:48:10,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:10,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:10,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:10,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:10,786 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:10,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -585619406, now seen corresponding path program 1 times [2023-11-23 08:48:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:10,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689289589] [2023-11-23 08:48:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:48:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:48:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:48:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:48:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689289589] [2023-11-23 08:48:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689289589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001277637] [2023-11-23 08:48:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:11,001 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:48:11,024 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:48:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:11,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:11,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001277637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:11,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:48:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746994122] [2023-11-23 08:48:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:48:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:48:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:48:11,182 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:11,347 INFO L93 Difference]: Finished difference Result 247 states and 344 transitions. [2023-11-23 08:48:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:48:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 08:48:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:11,348 INFO L225 Difference]: With dead ends: 247 [2023-11-23 08:48:11,348 INFO L226 Difference]: Without dead ends: 140 [2023-11-23 08:48:11,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:11,349 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:11,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-23 08:48:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2023-11-23 08:48:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 92 states have internal predecessors, (114), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:48:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2023-11-23 08:48:11,362 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 69 [2023-11-23 08:48:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:11,367 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2023-11-23 08:48:11,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2023-11-23 08:48:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:48:11,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:11,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:11,396 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:48:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:11,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:11,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 554004725, now seen corresponding path program 1 times [2023-11-23 08:48:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359146652] [2023-11-23 08:48:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:48:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:48:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:48:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359146652] [2023-11-23 08:48:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359146652] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503401649] [2023-11-23 08:48:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:11,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:11,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:11,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:11,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:48:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:11,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:48:11,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:48:11,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503401649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:11,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 08:48:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504056869] [2023-11-23 08:48:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:11,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:48:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:48:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:11,954 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:11,990 INFO L93 Difference]: Finished difference Result 245 states and 346 transitions. [2023-11-23 08:48:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:48:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 08:48:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:11,992 INFO L225 Difference]: With dead ends: 245 [2023-11-23 08:48:11,993 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 08:48:11,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:11,994 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:11,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 08:48:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2023-11-23 08:48:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 94 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:48:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-23 08:48:12,005 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 70 [2023-11-23 08:48:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:12,005 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-23 08:48:12,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-23 08:48:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:48:12,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:12,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:12,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:12,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:12,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:12,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 161882726, now seen corresponding path program 1 times [2023-11-23 08:48:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228202177] [2023-11-23 08:48:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:48:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:48:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:48:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228202177] [2023-11-23 08:48:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228202177] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209168780] [2023-11-23 08:48:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:12,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:12,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 08:48:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:12,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 08:48:12,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:12,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:48:12,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:48:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:48:13,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209168780] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:13,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 12] total 32 [2023-11-23 08:48:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575121689] [2023-11-23 08:48:13,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:13,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-23 08:48:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-23 08:48:13,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:48:13,850 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:48:16,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:18,990 INFO L93 Difference]: Finished difference Result 832 states and 1200 transitions. [2023-11-23 08:48:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-11-23 08:48:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 77 [2023-11-23 08:48:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:18,995 INFO L225 Difference]: With dead ends: 832 [2023-11-23 08:48:18,995 INFO L226 Difference]: Without dead ends: 661 [2023-11-23 08:48:18,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1114, Invalid=8198, Unknown=0, NotChecked=0, Total=9312 [2023-11-23 08:48:18,999 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 482 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 124 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:18,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1546 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1950 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-11-23 08:48:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-23 08:48:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 460. [2023-11-23 08:48:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 340 states have (on average 1.3294117647058823) internal successors, (452), 356 states have internal predecessors, (452), 76 states have call successors, (76), 29 states have call predecessors, (76), 43 states have return successors, (131), 74 states have call predecessors, (131), 70 states have call successors, (131) [2023-11-23 08:48:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 659 transitions. [2023-11-23 08:48:19,052 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 659 transitions. Word has length 77 [2023-11-23 08:48:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:19,052 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 659 transitions. [2023-11-23 08:48:19,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:48:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 659 transitions. [2023-11-23 08:48:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:19,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:19,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:48:19,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:19,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:19,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1845013039, now seen corresponding path program 1 times [2023-11-23 08:48:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924020642] [2023-11-23 08:48:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:48:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:48:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924020642] [2023-11-23 08:48:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924020642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545525048] [2023-11-23 08:48:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:19,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:19,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:48:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:19,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-23 08:48:19,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:19,868 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 7 [2023-11-23 08:48:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:20,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:20,424 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-23 08:48:20,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 88 [2023-11-23 08:48:20,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:20,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 103 [2023-11-23 08:48:20,440 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 29 treesize of output 27 [2023-11-23 08:48:20,463 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 5 treesize of output 3 [2023-11-23 08:48:20,481 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 5 treesize of output 3 [2023-11-23 08:48:20,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:20,487 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 22 treesize of output 26 [2023-11-23 08:48:20,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:20,513 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 38 treesize of output 42 [2023-11-23 08:48:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545525048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:20,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 25 [2023-11-23 08:48:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589214001] [2023-11-23 08:48:20,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 08:48:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 08:48:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:48:20,614 INFO L87 Difference]: Start difference. First operand 460 states and 659 transitions. Second operand has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:48:22,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:24,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:26,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:28,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:30,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:32,518 INFO L93 Difference]: Finished difference Result 1338 states and 2036 transitions. [2023-11-23 08:48:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-23 08:48:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 79 [2023-11-23 08:48:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:32,525 INFO L225 Difference]: With dead ends: 1338 [2023-11-23 08:48:32,525 INFO L226 Difference]: Without dead ends: 883 [2023-11-23 08:48:32,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=425, Invalid=2125, Unknown=0, NotChecked=0, Total=2550 [2023-11-23 08:48:32,528 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 443 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 91 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:32,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1037 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1147 Invalid, 5 Unknown, 0 Unchecked, 11.1s Time] [2023-11-23 08:48:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2023-11-23 08:48:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 551. [2023-11-23 08:48:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 420 states have (on average 1.3476190476190477) internal successors, (566), 434 states have internal predecessors, (566), 89 states have call successors, (89), 29 states have call predecessors, (89), 41 states have return successors, (138), 87 states have call predecessors, (138), 83 states have call successors, (138) [2023-11-23 08:48:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 793 transitions. [2023-11-23 08:48:32,591 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 793 transitions. Word has length 79 [2023-11-23 08:48:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:32,592 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 793 transitions. [2023-11-23 08:48:32,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:48:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 793 transitions. [2023-11-23 08:48:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:32,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:32,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:32,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:32,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:32,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1198730191, now seen corresponding path program 1 times [2023-11-23 08:48:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703469316] [2023-11-23 08:48:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:48:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703469316] [2023-11-23 08:48:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703469316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145493811] [2023-11-23 08:48:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:32,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:32,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:48:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:48:33,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:48:33,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:33,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145493811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:33,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:33,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:48:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340266322] [2023-11-23 08:48:33,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:33,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:48:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:48:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:48:33,097 INFO L87 Difference]: Start difference. First operand 551 states and 793 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:33,167 INFO L93 Difference]: Finished difference Result 957 states and 1413 transitions. [2023-11-23 08:48:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:48:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:48:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:33,171 INFO L225 Difference]: With dead ends: 957 [2023-11-23 08:48:33,171 INFO L226 Difference]: Without dead ends: 555 [2023-11-23 08:48:33,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:48:33,175 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:33,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 208 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2023-11-23 08:48:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 545. [2023-11-23 08:48:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 415 states have (on average 1.3277108433734939) internal successors, (551), 428 states have internal predecessors, (551), 89 states have call successors, (89), 29 states have call predecessors, (89), 40 states have return successors, (135), 87 states have call predecessors, (135), 83 states have call successors, (135) [2023-11-23 08:48:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 775 transitions. [2023-11-23 08:48:33,249 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 775 transitions. Word has length 80 [2023-11-23 08:48:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:33,249 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 775 transitions. [2023-11-23 08:48:33,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 775 transitions. [2023-11-23 08:48:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:33,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:33,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:48:33,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:33,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 08:48:33,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:33,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1400554125, now seen corresponding path program 1 times [2023-11-23 08:48:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635844147] [2023-11-23 08:48:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:48:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635844147] [2023-11-23 08:48:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635844147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960210055] [2023-11-23 08:48:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:33,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:33,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:48:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:48:33,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-23 08:48:33,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960210055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:48:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858355761] [2023-11-23 08:48:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:33,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:48:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:48:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:48:33,722 INFO L87 Difference]: Start difference. First operand 545 states and 775 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:33,769 INFO L93 Difference]: Finished difference Result 754 states and 1060 transitions. [2023-11-23 08:48:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:48:33,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:48:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:33,771 INFO L225 Difference]: With dead ends: 754 [2023-11-23 08:48:33,771 INFO L226 Difference]: Without dead ends: 198 [2023-11-23 08:48:33,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:48:33,773 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:33,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 200 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-23 08:48:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2023-11-23 08:48:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 152 states have internal predecessors, (184), 30 states have call successors, (30), 14 states have call predecessors, (30), 16 states have return successors, (32), 28 states have call predecessors, (32), 28 states have call successors, (32) [2023-11-23 08:48:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 246 transitions. [2023-11-23 08:48:33,790 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 246 transitions. Word has length 80 [2023-11-23 08:48:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:33,790 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 246 transitions. [2023-11-23 08:48:33,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 246 transitions. [2023-11-23 08:48:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:33,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:33,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:33,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:48:34,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:34,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1239796976, now seen corresponding path program 1 times [2023-11-23 08:48:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388677164] [2023-11-23 08:48:34,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:48:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388677164] [2023-11-23 08:48:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388677164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292667455] [2023-11-23 08:48:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:34,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:34,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:48:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:34,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-23 08:48:34,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:34,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:48:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:48:35,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:35,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 243 treesize of output 227 [2023-11-23 08:48:35,850 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 51 treesize of output 47 [2023-11-23 08:48:35,853 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 53 treesize of output 45 [2023-11-23 08:48:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292667455] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:35,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:35,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 15] total 39 [2023-11-23 08:48:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98248792] [2023-11-23 08:48:35,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:35,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 08:48:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 08:48:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 08:48:35,937 INFO L87 Difference]: Start difference. First operand 195 states and 246 transitions. Second operand has 39 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2023-11-23 08:48:37,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:40,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:42,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:44,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:46,159 INFO L93 Difference]: Finished difference Result 692 states and 891 transitions. [2023-11-23 08:48:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 08:48:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) Word has length 80 [2023-11-23 08:48:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:46,162 INFO L225 Difference]: With dead ends: 692 [2023-11-23 08:48:46,162 INFO L226 Difference]: Without dead ends: 478 [2023-11-23 08:48:46,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 148 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=802, Invalid=4600, Unknown=0, NotChecked=0, Total=5402 [2023-11-23 08:48:46,165 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 481 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 169 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:46,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1392 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2008 Invalid, 4 Unknown, 0 Unchecked, 9.2s Time] [2023-11-23 08:48:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-23 08:48:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 380. [2023-11-23 08:48:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 293 states have (on average 1.2525597269624573) internal successors, (367), 301 states have internal predecessors, (367), 56 states have call successors, (56), 24 states have call predecessors, (56), 30 states have return successors, (68), 54 states have call predecessors, (68), 52 states have call successors, (68) [2023-11-23 08:48:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 491 transitions. [2023-11-23 08:48:46,199 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 491 transitions. Word has length 80 [2023-11-23 08:48:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:46,199 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 491 transitions. [2023-11-23 08:48:46,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2023-11-23 08:48:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 491 transitions. [2023-11-23 08:48:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:46,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:46,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:46,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:46,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:48:46,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:46,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1976154612, now seen corresponding path program 1 times [2023-11-23 08:48:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668940832] [2023-11-23 08:48:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:48:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668940832] [2023-11-23 08:48:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668940832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034668001] [2023-11-23 08:48:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:46,589 INFO L229 MonitoredProcess]: Starting monitored process 12 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:48:46,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:48:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:46,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:48:46,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034668001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:46,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:48:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719918183] [2023-11-23 08:48:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:46,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:48:46,818 INFO L87 Difference]: Start difference. First operand 380 states and 491 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:46,918 INFO L93 Difference]: Finished difference Result 844 states and 1112 transitions. [2023-11-23 08:48:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:48:46,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2023-11-23 08:48:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:46,920 INFO L225 Difference]: With dead ends: 844 [2023-11-23 08:48:46,920 INFO L226 Difference]: Without dead ends: 367 [2023-11-23 08:48:46,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:48:46,921 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:46,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 279 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-23 08:48:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-23 08:48:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 280 states have (on average 1.2357142857142858) internal successors, (346), 288 states have internal predecessors, (346), 56 states have call successors, (56), 24 states have call predecessors, (56), 30 states have return successors, (68), 54 states have call predecessors, (68), 52 states have call successors, (68) [2023-11-23 08:48:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 470 transitions. [2023-11-23 08:48:46,951 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 470 transitions. Word has length 80 [2023-11-23 08:48:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:46,951 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 470 transitions. [2023-11-23 08:48:46,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 470 transitions. [2023-11-23 08:48:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:48:46,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:46,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:46,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 08:48:47,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:47,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1797909114, now seen corresponding path program 1 times [2023-11-23 08:48:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:47,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954468991] [2023-11-23 08:48:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:48:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:48:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:48:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:48:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:48:47,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:47,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954468991] [2023-11-23 08:48:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954468991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:47,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723601635] [2023-11-23 08:48:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:47,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:47,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:47,320 INFO L229 MonitoredProcess]: Starting monitored process 13 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:48:47,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:48:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:47,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 08:48:47,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:47,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:48:47,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:47,556 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 16 treesize of output 11 [2023-11-23 08:48:47,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:47,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:47,594 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 26 treesize of output 23 [2023-11-23 08:48:47,596 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 18 treesize of output 11 [2023-11-23 08:48:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:47,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723601635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:47,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:48:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2023-11-23 08:48:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274948735] [2023-11-23 08:48:47,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:48:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:48:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:47,898 INFO L87 Difference]: Start difference. First operand 367 states and 470 transitions. Second operand has 16 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:48:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:48,647 INFO L93 Difference]: Finished difference Result 500 states and 642 transitions. [2023-11-23 08:48:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 08:48:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 81 [2023-11-23 08:48:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:48,649 INFO L225 Difference]: With dead ends: 500 [2023-11-23 08:48:48,649 INFO L226 Difference]: Without dead ends: 298 [2023-11-23 08:48:48,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2023-11-23 08:48:48,650 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 99 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:48,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 983 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:48:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-23 08:48:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 287. [2023-11-23 08:48:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 226 states have internal predecessors, (266), 43 states have call successors, (43), 19 states have call predecessors, (43), 25 states have return successors, (54), 41 states have call predecessors, (54), 40 states have call successors, (54) [2023-11-23 08:48:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 363 transitions. [2023-11-23 08:48:48,675 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 363 transitions. Word has length 81 [2023-11-23 08:48:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:48,675 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 363 transitions. [2023-11-23 08:48:48,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:48:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 363 transitions. [2023-11-23 08:48:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 08:48:48,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:48,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:48,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:48,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:48:48,889 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:48,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -850121196, now seen corresponding path program 1 times [2023-11-23 08:48:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555421203] [2023-11-23 08:48:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:48:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:48:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 08:48:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555421203] [2023-11-23 08:48:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555421203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549561304] [2023-11-23 08:48:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:49,086 INFO L229 MonitoredProcess]: Starting monitored process 14 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:48:49,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:48:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:48:49,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:48:49,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549561304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:48:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927554052] [2023-11-23 08:48:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:49,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:48:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:48:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:48:49,390 INFO L87 Difference]: Start difference. First operand 287 states and 363 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:49,579 INFO L93 Difference]: Finished difference Result 490 states and 619 transitions. [2023-11-23 08:48:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:48:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-11-23 08:48:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:49,581 INFO L225 Difference]: With dead ends: 490 [2023-11-23 08:48:49,581 INFO L226 Difference]: Without dead ends: 284 [2023-11-23 08:48:49,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:48:49,582 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:49,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 272 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-23 08:48:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2023-11-23 08:48:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 216 states have (on average 1.1990740740740742) internal successors, (259), 223 states have internal predecessors, (259), 43 states have call successors, (43), 19 states have call predecessors, (43), 24 states have return successors, (52), 41 states have call predecessors, (52), 40 states have call successors, (52) [2023-11-23 08:48:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 354 transitions. [2023-11-23 08:48:49,608 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 354 transitions. Word has length 84 [2023-11-23 08:48:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:49,608 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 354 transitions. [2023-11-23 08:48:49,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 354 transitions. [2023-11-23 08:48:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 08:48:49,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:49,609 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:49,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:49,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:48:49,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:49,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1350102166, now seen corresponding path program 1 times [2023-11-23 08:48:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326796244] [2023-11-23 08:48:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:49,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:48:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:48:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 08:48:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326796244] [2023-11-23 08:48:50,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326796244] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589949118] [2023-11-23 08:48:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:50,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:50,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:50,069 INFO L229 MonitoredProcess]: Starting monitored process 15 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:48:50,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:48:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-23 08:48:50,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:50,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2023-11-23 08:48:50,327 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 08:48:50,330 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 7 [2023-11-23 08:48:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 08:48:52,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:57,545 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40|) 8)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|)) (forall ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_40|) 8))))) (= (mod c_assume_abort_if_not_~cond 256) 0) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from false [2023-11-23 08:48:58,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:58,374 INFO L349 Elim1Store]: treesize reduction 223, result has 49.4 percent of original size [2023-11-23 08:48:58,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 4186 treesize of output 3172 [2023-11-23 08:48:58,651 INFO L349 Elim1Store]: treesize reduction 17, result has 86.4 percent of original size [2023-11-23 08:48:58,652 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 12748 treesize of output 11895 [2023-11-23 08:48:58,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:58,879 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 4930 treesize of output 4802 [2023-11-23 08:48:59,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:59,127 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 3874 treesize of output 3818 [2023-11-23 08:48:59,340 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-11-23 08:48:59,340 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 4389 treesize of output 4128 [2023-11-23 08:48:59,764 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:49:09,665 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:49:11,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-23 08:49:11,759 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:49:11,979 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:49:11,980 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 08:49:11,989 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:49:11,989 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 08:49:12,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:49:12,004 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:49:12,004 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2023-11-23 08:49:12,010 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:49:12,035 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 41 treesize of output 37 [2023-11-23 08:49:12,046 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:49:12,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:12,052 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:49:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:49:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589949118] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:49:12,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:49:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 27, 25] total 55 [2023-11-23 08:49:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787202178] [2023-11-23 08:49:12,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:12,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 08:49:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 08:49:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2644, Unknown=2, NotChecked=104, Total=2970 [2023-11-23 08:49:12,196 INFO L87 Difference]: Start difference. First operand 284 states and 354 transitions. Second operand has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 08:49:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:18,492 INFO L93 Difference]: Finished difference Result 633 states and 834 transitions. [2023-11-23 08:49:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 08:49:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) Word has length 104 [2023-11-23 08:49:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:18,495 INFO L225 Difference]: With dead ends: 633 [2023-11-23 08:49:18,495 INFO L226 Difference]: Without dead ends: 432 [2023-11-23 08:49:18,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 188 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1156, Invalid=9352, Unknown=2, NotChecked=202, Total=10712 [2023-11-23 08:49:18,498 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 493 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:18,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1038 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2036 Invalid, 0 Unknown, 237 Unchecked, 2.1s Time] [2023-11-23 08:49:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-23 08:49:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 301. [2023-11-23 08:49:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 229 states have (on average 1.1921397379912664) internal successors, (273), 237 states have internal predecessors, (273), 43 states have call successors, (43), 19 states have call predecessors, (43), 28 states have return successors, (60), 44 states have call predecessors, (60), 40 states have call successors, (60) [2023-11-23 08:49:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 376 transitions. [2023-11-23 08:49:18,536 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 376 transitions. Word has length 104 [2023-11-23 08:49:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:18,537 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 376 transitions. [2023-11-23 08:49:18,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 08:49:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 376 transitions. [2023-11-23 08:49:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 08:49:18,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:18,539 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 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:49:18,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:49:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:18,753 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:18,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1642809720, now seen corresponding path program 1 times [2023-11-23 08:49:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175033741] [2023-11-23 08:49:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:49:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:49:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:49:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:49:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:49:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:49:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175033741] [2023-11-23 08:49:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175033741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551639333] [2023-11-23 08:49:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:19,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:19,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:19,486 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:19,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:49:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:19,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-23 08:49:19,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:19,774 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 13 treesize of output 1 [2023-11-23 08:49:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 08:49:20,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:21,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 103 treesize of output 95 [2023-11-23 08:49:21,324 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 103 treesize of output 95 [2023-11-23 08:49:21,329 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 49 treesize of output 45 [2023-11-23 08:49:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:49:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551639333] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:49:21,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:49:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 49 [2023-11-23 08:49:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803025754] [2023-11-23 08:49:21,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-23 08:49:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-23 08:49:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2159, Unknown=0, NotChecked=0, Total=2352 [2023-11-23 08:49:21,397 INFO L87 Difference]: Start difference. First operand 301 states and 376 transitions. Second operand has 49 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 18 states have call successors, (28), 3 states have call predecessors, (28), 11 states have return successors, (27), 16 states have call predecessors, (27), 17 states have call successors, (27) [2023-11-23 08:49:23,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:25,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:27,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:29,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:31,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:35,498 INFO L93 Difference]: Finished difference Result 1074 states and 1475 transitions. [2023-11-23 08:49:35,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-23 08:49:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 18 states have call successors, (28), 3 states have call predecessors, (28), 11 states have return successors, (27), 16 states have call predecessors, (27), 17 states have call successors, (27) Word has length 107 [2023-11-23 08:49:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:35,501 INFO L225 Difference]: With dead ends: 1074 [2023-11-23 08:49:35,501 INFO L226 Difference]: Without dead ends: 739 [2023-11-23 08:49:35,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2978 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1491, Invalid=10065, Unknown=0, NotChecked=0, Total=11556 [2023-11-23 08:49:35,505 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 398 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 160 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:35,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1707 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 3116 Invalid, 5 Unknown, 0 Unchecked, 12.2s Time] [2023-11-23 08:49:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-11-23 08:49:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 556. [2023-11-23 08:49:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.2608695652173914) internal successors, (551), 440 states have internal predecessors, (551), 71 states have call successors, (71), 29 states have call predecessors, (71), 47 states have return successors, (116), 86 states have call predecessors, (116), 66 states have call successors, (116) [2023-11-23 08:49:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 738 transitions. [2023-11-23 08:49:35,582 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 738 transitions. Word has length 107 [2023-11-23 08:49:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:35,582 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 738 transitions. [2023-11-23 08:49:35,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 18 states have call successors, (28), 3 states have call predecessors, (28), 11 states have return successors, (27), 16 states have call predecessors, (27), 17 states have call successors, (27) [2023-11-23 08:49:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 738 transitions. [2023-11-23 08:49:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 08:49:35,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:35,584 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:49:35,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 08:49:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:49:35,797 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:35,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2065351562, now seen corresponding path program 1 times [2023-11-23 08:49:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490113933] [2023-11-23 08:49:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:49:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:49:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:49:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:49:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:49:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 08:49:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490113933] [2023-11-23 08:49:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490113933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:49:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712852730] [2023-11-23 08:49:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:49:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:49:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:49:36,071 INFO L87 Difference]: Start difference. First operand 556 states and 738 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 08:49:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:36,268 INFO L93 Difference]: Finished difference Result 1094 states and 1494 transitions. [2023-11-23 08:49:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:49:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 107 [2023-11-23 08:49:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:36,271 INFO L225 Difference]: With dead ends: 1094 [2023-11-23 08:49:36,271 INFO L226 Difference]: Without dead ends: 551 [2023-11-23 08:49:36,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:49:36,273 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:36,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 402 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-11-23 08:49:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 531. [2023-11-23 08:49:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 415 states have (on average 1.2289156626506024) internal successors, (510), 420 states have internal predecessors, (510), 71 states have call successors, (71), 29 states have call predecessors, (71), 44 states have return successors, (104), 81 states have call predecessors, (104), 66 states have call successors, (104) [2023-11-23 08:49:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 685 transitions. [2023-11-23 08:49:36,349 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 685 transitions. Word has length 107 [2023-11-23 08:49:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:36,349 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 685 transitions. [2023-11-23 08:49:36,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 08:49:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 685 transitions. [2023-11-23 08:49:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 08:49:36,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:36,351 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:36,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 08:49:36,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:36,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 639808003, now seen corresponding path program 1 times [2023-11-23 08:49:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525720960] [2023-11-23 08:49:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:49:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:49:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:49:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:49:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:49:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 08:49:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525720960] [2023-11-23 08:49:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525720960] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556200944] [2023-11-23 08:49:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:36,682 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49:36,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 08:49:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:36,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-23 08:49:36,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:36,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:49:36,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:49:39,054 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|)))) is different from true [2023-11-23 08:49:41,140 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_64|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_64|) 0) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_64|)))) is different from true [2023-11-23 08:49:43,219 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_30| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_30| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_30|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_30| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_30|) 0) 16)))) is different from true [2023-11-23 08:49:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 62 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-23 08:49:55,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556200944] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:55,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:49:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2023-11-23 08:49:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979389561] [2023-11-23 08:49:55,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 08:49:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 08:49:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=447, Unknown=9, NotChecked=132, Total=650 [2023-11-23 08:49:55,699 INFO L87 Difference]: Start difference. First operand 531 states and 685 transitions. Second operand has 25 states, 23 states have (on average 5.173913043478261) internal successors, (119), 23 states have internal predecessors, (119), 9 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:49:57,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:59,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:01,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:03,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:05,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:07,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:09,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:11,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:13,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:15,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:21,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:23,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:25,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:33,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:35,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:37,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:39,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:42,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:44,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:46,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:48,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:58,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:00,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:02,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:04,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:06,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:08,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:16,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:18,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15