./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:39:49,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:39:49,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:39:49,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:39:49,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:39:49,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:39:49,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:39:49,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:39:49,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:39:49,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:39:49,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:39:49,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:39:49,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:39:49,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:39:49,728 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:39:49,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:39:49,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:39:49,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:39:49,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:39:49,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:39:49,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:39:49,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:39:49,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:39:49,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:39:49,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:39:49,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:39:49,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:39:49,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:39:49,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:39:49,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:49,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:39:49,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:39:49,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:39:49,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:39:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:39:49,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:39:49,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:39:49,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:39:49,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:39:49,735 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 [2024-10-11 14:39:49,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:39:49,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:39:49,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:39:49,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:39:49,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:39:49,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2024-10-11 14:39:51,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:39:51,439 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:39:51,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2024-10-11 14:39:51,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa388ce64/18ab7fe9e76b40f4a9369830942db0b4/FLAGc4aa21a81 [2024-10-11 14:39:51,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa388ce64/18ab7fe9e76b40f4a9369830942db0b4 [2024-10-11 14:39:51,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:39:51,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:39:51,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:51,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:39:51,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:39:51,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:51" (1/1) ... [2024-10-11 14:39:51,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686af822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:51, skipping insertion in model container [2024-10-11 14:39:51,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:51" (1/1) ... [2024-10-11 14:39:51,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:39:51,756 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i[4494,4507] [2024-10-11 14:39:51,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i[4554,4567] [2024-10-11 14:39:52,365 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,365 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,366 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,366 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,366 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,373 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,373 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,374 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,375 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,376 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,377 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,377 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,378 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,663 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,671 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:52,727 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:39:52,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i[4494,4507] [2024-10-11 14:39:52,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i[4554,4567] [2024-10-11 14:39:52,773 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,773 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,776 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,776 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,776 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,782 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,782 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,783 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,783 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,784 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,784 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,785 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,785 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,825 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,828 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:52,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] [2024-10-11 14:39:52,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:52,993 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:39:52,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52 WrapperNode [2024-10-11 14:39:52,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:52,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:52,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:39:52,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:39:53,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,112 INFO L138 Inliner]: procedures = 680, calls = 1676, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 660 [2024-10-11 14:39:53,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:53,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:39:53,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:39:53,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:39:53,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,191 INFO L175 MemorySlicer]: Split 312 memory accesses to 6 slices as follows [236, 2, 6, 9, 56, 3]. 76 percent of accesses are in the largest equivalence class. The 254 initializations are split as follows [236, 2, 0, 5, 10, 1]. The 7 writes are split as follows [0, 0, 2, 1, 3, 1]. [2024-10-11 14:39:53,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:39:53,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:39:53,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:39:53,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:39:53,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (1/1) ... [2024-10-11 14:39:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:53,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:53,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:39:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:39:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-10-11 14:39:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-11 14:39:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-11 14:39:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:39:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:39:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 14:39:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-11 14:39:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-11 14:39:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 14:39:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 14:39:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-10-11 14:39:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:39:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:39:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-11 14:39:53,317 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-11 14:39:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-11 14:39:53,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-11 14:39:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-11 14:39:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-11 14:39:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-11 14:39:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-11 14:39:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-10-11 14:39:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-10-11 14:39:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2024-10-11 14:39:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2024-10-11 14:39:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:39:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:39:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-10-11 14:39:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-10-11 14:39:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-11 14:39:53,320 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-11 14:39:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-11 14:39:53,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:53,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:39:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 14:39:53,577 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:39:53,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:39:54,202 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-11 14:39:54,203 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:39:54,289 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:39:54,290 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:39:54,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:54 BoogieIcfgContainer [2024-10-11 14:39:54,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:39:54,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:39:54,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:39:54,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:39:54,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:51" (1/3) ... [2024-10-11 14:39:54,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced56b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:54, skipping insertion in model container [2024-10-11 14:39:54,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:52" (2/3) ... [2024-10-11 14:39:54,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced56b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:54, skipping insertion in model container [2024-10-11 14:39:54,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:54" (3/3) ... [2024-10-11 14:39:54,297 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_front_harness_negated.i [2024-10-11 14:39:54,309 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:39:54,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:39:54,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:39:54,369 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c5e065e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:39:54,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:39:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 14:39:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:39:54,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:54,383 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:54,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:54,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash -583617916, now seen corresponding path program 1 times [2024-10-11 14:39:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:54,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414609549] [2024-10-11 14:39:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:39:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:39:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:39:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:39:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:39:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:39:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:39:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:39:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:39:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 14:39:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:39:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 14:39:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 14:39:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414609549] [2024-10-11 14:39:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414609549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:39:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610297625] [2024-10-11 14:39:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:39:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:39:55,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:39:55,120 INFO L87 Difference]: Start difference. First operand has 170 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 14:39:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:55,972 INFO L93 Difference]: Finished difference Result 352 states and 523 transitions. [2024-10-11 14:39:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:39:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 123 [2024-10-11 14:39:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:55,984 INFO L225 Difference]: With dead ends: 352 [2024-10-11 14:39:55,984 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 14:39:55,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:39:55,992 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 96 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:55,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 288 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:39:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 14:39:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2024-10-11 14:39:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 92 states have internal predecessors, (108), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:39:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2024-10-11 14:39:56,056 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 123 [2024-10-11 14:39:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:56,057 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2024-10-11 14:39:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 14:39:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2024-10-11 14:39:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:39:56,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:56,061 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:39:56,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:56,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1117143876, now seen corresponding path program 1 times [2024-10-11 14:39:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286992716] [2024-10-11 14:39:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:39:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:39:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:39:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:39:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:39:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:39:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:39:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:39:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:39:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 14:39:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:39:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 14:39:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 14:39:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286992716] [2024-10-11 14:39:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286992716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:56,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:56,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:39:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646363219] [2024-10-11 14:39:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:56,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:39:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:56,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:39:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:39:56,762 INFO L87 Difference]: Start difference. First operand 164 states and 218 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 14:39:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:58,017 INFO L93 Difference]: Finished difference Result 301 states and 411 transitions. [2024-10-11 14:39:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:39:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 123 [2024-10-11 14:39:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:58,020 INFO L225 Difference]: With dead ends: 301 [2024-10-11 14:39:58,020 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 14:39:58,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:39:58,022 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 145 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:58,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 660 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 14:39:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 14:39:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2024-10-11 14:39:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 100 states have internal predecessors, (117), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-11 14:39:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2024-10-11 14:39:58,044 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 123 [2024-10-11 14:39:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:58,045 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2024-10-11 14:39:58,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 14:39:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2024-10-11 14:39:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:39:58,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:58,047 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:39:58,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:58,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1993162882, now seen corresponding path program 1 times [2024-10-11 14:39:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324310084] [2024-10-11 14:39:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:39:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:39:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:39:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:39:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:39:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:39:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:39:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:39:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:39:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 14:39:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:39:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 14:39:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 14:39:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324310084] [2024-10-11 14:39:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324310084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:58,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:58,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:39:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189669427] [2024-10-11 14:39:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:58,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:39:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:58,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:39:58,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:58,715 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 14:40:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:00,091 INFO L93 Difference]: Finished difference Result 316 states and 439 transitions. [2024-10-11 14:40:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:40:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 123 [2024-10-11 14:40:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:00,093 INFO L225 Difference]: With dead ends: 316 [2024-10-11 14:40:00,093 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 14:40:00,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:40:00,095 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:00,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 774 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:40:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 14:40:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 183. [2024-10-11 14:40:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 103 states have internal predecessors, (120), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (62), 62 states have call predecessors, (62), 61 states have call successors, (62) [2024-10-11 14:40:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 245 transitions. [2024-10-11 14:40:00,114 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 245 transitions. Word has length 123 [2024-10-11 14:40:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:00,115 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 245 transitions. [2024-10-11 14:40:00,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 14:40:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 245 transitions. [2024-10-11 14:40:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:40:00,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:00,117 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:40:00,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:00,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1598796096, now seen corresponding path program 1 times [2024-10-11 14:40:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496605878] [2024-10-11 14:40:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:40:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 14:40:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:40:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 14:40:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-11 14:40:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496605878] [2024-10-11 14:40:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496605878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:40:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447278410] [2024-10-11 14:40:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:40:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:40:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:40:00,751 INFO L87 Difference]: Start difference. First operand 183 states and 245 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 14:40:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:01,779 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-10-11 14:40:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:40:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 123 [2024-10-11 14:40:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:01,781 INFO L225 Difference]: With dead ends: 206 [2024-10-11 14:40:01,782 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 14:40:01,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:40:01,782 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:01,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 655 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:40:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 14:40:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 190. [2024-10-11 14:40:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 64 states have call successors, (64), 18 states have call predecessors, (64), 19 states have return successors, (73), 63 states have call predecessors, (73), 62 states have call successors, (73) [2024-10-11 14:40:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2024-10-11 14:40:01,813 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 123 [2024-10-11 14:40:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2024-10-11 14:40:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 14:40:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2024-10-11 14:40:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 14:40:01,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:01,817 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:01,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:40:01,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:01,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2095779195, now seen corresponding path program 1 times [2024-10-11 14:40:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573630202] [2024-10-11 14:40:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:40:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 14:40:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:40:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 14:40:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-10-11 14:40:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573630202] [2024-10-11 14:40:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573630202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130791168] [2024-10-11 14:40:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:02,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:02,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:02,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:40:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:02,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:40:02,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-11 14:40:03,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:40:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130791168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:03,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:40:03,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-10-11 14:40:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297400736] [2024-10-11 14:40:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:03,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:40:03,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:40:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:40:03,116 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 14:40:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:03,471 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2024-10-11 14:40:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 136 [2024-10-11 14:40:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:03,474 INFO L225 Difference]: With dead ends: 353 [2024-10-11 14:40:03,474 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 14:40:03,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:40:03,476 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:03,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1155 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:40:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 14:40:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-11 14:40:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 94 states have internal predecessors, (106), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-11 14:40:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2024-10-11 14:40:03,496 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 136 [2024-10-11 14:40:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:03,497 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2024-10-11 14:40:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 14:40:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2024-10-11 14:40:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 14:40:03,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:03,499 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:03,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:40:03,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:03,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:03,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2091003050, now seen corresponding path program 1 times [2024-10-11 14:40:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586878863] [2024-10-11 14:40:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 14:40:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:40:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 14:40:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 14:40:04,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:04,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586878863] [2024-10-11 14:40:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586878863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:40:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633917408] [2024-10-11 14:40:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:40:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:40:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:40:04,272 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 14:40:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:05,017 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2024-10-11 14:40:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 136 [2024-10-11 14:40:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:05,019 INFO L225 Difference]: With dead ends: 183 [2024-10-11 14:40:05,019 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 14:40:05,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:40:05,020 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 139 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:05,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 477 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:40:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 14:40:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2024-10-11 14:40:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 97 states have internal predecessors, (109), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-11 14:40:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 228 transitions. [2024-10-11 14:40:05,031 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 228 transitions. Word has length 136 [2024-10-11 14:40:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:05,032 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 228 transitions. [2024-10-11 14:40:05,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 14:40:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 228 transitions. [2024-10-11 14:40:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:40:05,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:05,033 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:40:05,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:05,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1472875254, now seen corresponding path program 1 times [2024-10-11 14:40:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026475775] [2024-10-11 14:40:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 14:40:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:40:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 14:40:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 14:40:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 14:40:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-11 14:40:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026475775] [2024-10-11 14:40:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026475775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:40:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108497162] [2024-10-11 14:40:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:40:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:40:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:40:05,386 INFO L87 Difference]: Start difference. First operand 174 states and 228 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 14:40:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:06,207 INFO L93 Difference]: Finished difference Result 218 states and 282 transitions. [2024-10-11 14:40:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 148 [2024-10-11 14:40:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:06,208 INFO L225 Difference]: With dead ends: 218 [2024-10-11 14:40:06,209 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 14:40:06,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:06,209 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 153 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 476 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:40:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 14:40:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2024-10-11 14:40:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 99 states have internal predecessors, (111), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-11 14:40:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2024-10-11 14:40:06,224 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 148 [2024-10-11 14:40:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2024-10-11 14:40:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 14:40:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2024-10-11 14:40:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:40:06,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:06,227 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:06,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:40:06,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:06,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1000583590, now seen corresponding path program 1 times [2024-10-11 14:40:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555882692] [2024-10-11 14:40:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 14:40:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:40:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 14:40:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 14:40:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 14:40:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 14:40:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-11 14:40:06,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:06,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555882692] [2024-10-11 14:40:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555882692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:40:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096006824] [2024-10-11 14:40:06,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:40:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:40:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:40:06,837 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 14:40:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:07,678 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2024-10-11 14:40:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:40:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 153 [2024-10-11 14:40:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:07,680 INFO L225 Difference]: With dead ends: 189 [2024-10-11 14:40:07,680 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 14:40:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:40:07,682 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 490 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:40:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 14:40:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-10-11 14:40:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 102 states have internal predecessors, (114), 60 states have call successors, (60), 18 states have call predecessors, (60), 18 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-11 14:40:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2024-10-11 14:40:07,696 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 153 [2024-10-11 14:40:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2024-10-11 14:40:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 14:40:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2024-10-11 14:40:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 14:40:07,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:07,698 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:07,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:40:07,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:07,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1864855197, now seen corresponding path program 1 times [2024-10-11 14:40:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383785404] [2024-10-11 14:40:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:40:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:40:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:40:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 14:40:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:40:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 14:40:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:40:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 14:40:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 14:40:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 14:40:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-10-11 14:40:08,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383785404] [2024-10-11 14:40:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383785404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116421616] [2024-10-11 14:40:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:08,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:08,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:08,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:40:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:08,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 2321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:40:08,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-11 14:40:08,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:40:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116421616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:40:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-11 14:40:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026526150] [2024-10-11 14:40:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:08,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:40:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:40:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:08,803 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-11 14:40:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:08,974 INFO L93 Difference]: Finished difference Result 282 states and 361 transitions. [2024-10-11 14:40:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:40:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) Word has length 157 [2024-10-11 14:40:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:08,976 INFO L225 Difference]: With dead ends: 282 [2024-10-11 14:40:08,976 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 14:40:08,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:08,977 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:08,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:40:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 14:40:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-11 14:40:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.1111111111111112) internal successors, (100), 91 states have internal predecessors, (100), 53 states have call successors, (53), 18 states have call predecessors, (53), 17 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 14:40:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2024-10-11 14:40:08,987 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 157 [2024-10-11 14:40:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:08,987 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2024-10-11 14:40:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-11 14:40:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2024-10-11 14:40:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 14:40:08,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:08,989 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:09,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:40:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:09,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -74845578, now seen corresponding path program 1 times [2024-10-11 14:40:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299115679] [2024-10-11 14:40:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:40:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:40:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:40:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:40:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:40:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:40:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 14:40:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:40:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:40:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:40:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 14:40:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 14:40:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 14:40:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-10-11 14:40:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299115679] [2024-10-11 14:40:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299115679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126939508] [2024-10-11 14:40:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:09,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:09,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:40:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:10,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 2361 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 14:40:10,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-11 14:40:10,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:40:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126939508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:40:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 14:40:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913838297] [2024-10-11 14:40:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:10,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:40:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:40:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:10,305 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-11 14:40:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:10,499 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2024-10-11 14:40:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:40:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 167 [2024-10-11 14:40:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:10,500 INFO L225 Difference]: With dead ends: 175 [2024-10-11 14:40:10,500 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 14:40:10,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:10,502 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:10,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:40:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 14:40:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 14:40:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:40:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 14:40:10,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2024-10-11 14:40:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 14:40:10,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-11 14:40:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 14:40:10,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 14:40:10,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:40:10,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:40:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:10,714 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:10,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 14:40:10,908 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:40:10,918 WARN L155 FloydHoareUtils]: Requires clause for bounded_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:40:10,921 WARN L155 FloydHoareUtils]: Requires clause for ensure_array_list_has_allocated_data_member contained old-variable. Original clause: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |#memory_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: true [2024-10-11 14:40:10,923 WARN L155 FloydHoareUtils]: Requires clause for aws_array_list_is_valid contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_int#5| |old(#memory_int#5)|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_real#5| |old(#memory_real#5)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:40:10,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 14:40:10,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 14:40:10,928 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.offset [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.offset [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.base [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.base [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#5 [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#5 [2024-10-11 14:40:10,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 14:40:10,930 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 14:40:10,930 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~list!base [2024-10-11 14:40:10,930 WARN L155 FloydHoareUtils]: Requires clause for aws_raise_error contained old-variable. Original clause: (= ~tl_last_error~0 |old(~tl_last_error~0)|) Eliminated clause: true [2024-10-11 14:40:10,931 WARN L155 FloydHoareUtils]: Requires clause for __CPROVER_overflow_mult contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:40:10,934 WARN L155 FloydHoareUtils]: Requires clause for aws_mul_size_checked contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_int#5| |old(#memory_int#5)|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_real#5| |old(#memory_real#5)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:40:10,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:40:10 BoogieIcfgContainer [2024-10-11 14:40:10,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:40:10,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:40:10,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:40:10,935 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:40:10,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:54" (3/4) ... [2024-10-11 14:40:10,937 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_bounded [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_valid [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memcpy [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2024-10-11 14:40:10,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert_byte_from_buffer_matches [2024-10-11 14:40:10,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_size_t [2024-10-11 14:40:10,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2024-10-11 14:40:10,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_impl [2024-10-11 14:40:10,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_length [2024-10-11 14:40:10,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 14:40:10,951 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2024-10-11 14:40:10,952 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2024-10-11 14:40:10,953 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-10-11 14:40:10,954 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 14:40:10,955 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 14:40:10,955 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:40:10,956 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 14:40:10,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 14:40:11,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:40:11,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:40:11,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:40:11,315 INFO L158 Benchmark]: Toolchain (without parser) took 19828.69ms. Allocated memory was 188.7MB in the beginning and 627.0MB in the end (delta: 438.3MB). Free memory was 109.8MB in the beginning and 365.2MB in the end (delta: -255.4MB). Peak memory consumption was 183.3MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,315 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:40:11,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1506.55ms. Allocated memory is still 188.7MB. Free memory was 109.8MB in the beginning and 112.7MB in the end (delta: -3.0MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.79ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 103.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,316 INFO L158 Benchmark]: Boogie Preprocessor took 138.41ms. Allocated memory is still 188.7MB. Free memory was 103.3MB in the beginning and 87.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,316 INFO L158 Benchmark]: RCFGBuilder took 1038.60ms. Allocated memory was 188.7MB in the beginning and 287.3MB in the end (delta: 98.6MB). Free memory was 87.6MB in the beginning and 137.7MB in the end (delta: -50.1MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,317 INFO L158 Benchmark]: TraceAbstraction took 16642.79ms. Allocated memory was 287.3MB in the beginning and 627.0MB in the end (delta: 339.7MB). Free memory was 136.7MB in the beginning and 491.0MB in the end (delta: -354.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:40:11,317 INFO L158 Benchmark]: Witness Printer took 379.07ms. Allocated memory is still 627.0MB. Free memory was 491.0MB in the beginning and 365.2MB in the end (delta: 125.8MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2024-10-11 14:40:11,318 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1506.55ms. Allocated memory is still 188.7MB. Free memory was 109.8MB in the beginning and 112.7MB in the end (delta: -3.0MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.79ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 103.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.41ms. Allocated memory is still 188.7MB. Free memory was 103.3MB in the beginning and 87.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1038.60ms. Allocated memory was 188.7MB in the beginning and 287.3MB in the end (delta: 98.6MB). Free memory was 87.6MB in the beginning and 137.7MB in the end (delta: -50.1MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16642.79ms. Allocated memory was 287.3MB in the beginning and 627.0MB in the end (delta: 339.7MB). Free memory was 136.7MB in the beginning and 491.0MB in the end (delta: -354.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 379.07ms. Allocated memory is still 627.0MB. Free memory was 491.0MB in the beginning and 365.2MB in the end (delta: 125.8MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7735]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#5.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~list!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 170 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 5782 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4509 mSDsCounter, 1295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5312 IncrementalHoareTripleChecker+Invalid, 6607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1295 mSolverCounterUnsat, 1273 mSDtfsCounter, 5312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1048 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=4, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1836 ConstructedInterpolants, 0 QuantifiedInterpolants, 4010 SizeOfPredicates, 4 NumberOfNonLiveVariables, 7019 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 3568/3602 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7349]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 2795]: Procedure Contract for can_fail_malloc Derived contract for procedure can_fail_malloc. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 210]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 7355]: Procedure Contract for my_memcpy Derived contract for procedure my_memcpy. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7162]: Procedure Contract for assert_byte_from_buffer_matches Derived contract for procedure assert_byte_from_buffer_matches. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7341]: Procedure Contract for memcpy_impl Derived contract for procedure memcpy_impl. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3487]: Procedure Contract for aws_array_list_length Derived contract for procedure aws_array_list_length. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 222]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-11 14:40:11,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE