./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/logname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:18:09,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:18:10,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-23 23:18:10,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:18:10,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:18:10,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:18:10,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:18:10,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:18:10,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:18:10,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:18:10,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:18:10,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:18:10,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:18:10,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:18:10,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:18:10,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:18:10,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:18:10,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:18:10,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:18:10,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:18:10,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:18:10,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:18:10,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:18:10,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2024-11-23 23:18:10,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:18:10,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:18:10,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:18:10,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:18:10,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:18:10,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2024-11-23 23:18:13,773 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/data/3dc2d2553/8a967a1bbe7c4e85ac18923576a5363f/FLAG84c08d6be [2024-11-23 23:18:14,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:18:14,314 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2024-11-23 23:18:14,354 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/data/3dc2d2553/8a967a1bbe7c4e85ac18923576a5363f/FLAG84c08d6be [2024-11-23 23:18:14,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/data/3dc2d2553/8a967a1bbe7c4e85ac18923576a5363f [2024-11-23 23:18:14,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:18:14,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:18:14,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:18:14,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:18:14,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:18:14,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:14" (1/1) ... [2024-11-23 23:18:14,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a931eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:14, skipping insertion in model container [2024-11-23 23:18:14,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:14" (1/1) ... [2024-11-23 23:18:14,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:18:15,885 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,888 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,891 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,893 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,893 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,894 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,895 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,896 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,897 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,900 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,902 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,910 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,910 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,914 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,926 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,938 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:18:15,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:18:15,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:18:16,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:18:16,480 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-23 23:18:16,488 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:18:16,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16 WrapperNode [2024-11-23 23:18:16,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:18:16,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:18:16,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:18:16,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:18:16,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,624 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 811 [2024-11-23 23:18:16,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:18:16,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:18:16,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:18:16,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:18:16,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,699 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-23 23:18:16,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:18:16,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:18:16,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:18:16,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:18:16,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (1/1) ... [2024-11-23 23:18:16,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:18:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:16,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:18:16,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:18:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:18:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-23 23:18:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:18:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:18:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-23 23:18:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-23 23:18:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-23 23:18:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-23 23:18:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 23:18:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 23:18:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 23:18:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-23 23:18:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2024-11-23 23:18:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2024-11-23 23:18:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-23 23:18:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-23 23:18:17,409 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:18:17,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:18:19,028 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2024-11-23 23:18:19,028 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:18:19,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:18:19,048 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-23 23:18:19,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:19 BoogieIcfgContainer [2024-11-23 23:18:19,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:18:19,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:18:19,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:18:19,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:18:19,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:18:14" (1/3) ... [2024-11-23 23:18:19,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52612f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:19, skipping insertion in model container [2024-11-23 23:18:19,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:16" (2/3) ... [2024-11-23 23:18:19,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52612f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:19, skipping insertion in model container [2024-11-23 23:18:19,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:19" (3/3) ... [2024-11-23 23:18:19,060 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2024-11-23 23:18:19,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:18:19,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 313 locations, 1 initial locations, 12 loop locations, and 119 error locations. [2024-11-23 23:18:19,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:18:19,166 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=None, 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;@6632d364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:18:19,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-11-23 23:18:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 180 states have (on average 1.8888888888888888) internal successors, (340), 299 states have internal predecessors, (340), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-23 23:18:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-23 23:18:19,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:19,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-23 23:18:19,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:19,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 71563, now seen corresponding path program 1 times [2024-11-23 23:18:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377543357] [2024-11-23 23:18:19,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377543357] [2024-11-23 23:18:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377543357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:20,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:18:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818143531] [2024-11-23 23:18:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:18:20,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:20,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:18:20,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:20,232 INFO L87 Difference]: Start difference. First operand has 313 states, 180 states have (on average 1.8888888888888888) internal successors, (340), 299 states have internal predecessors, (340), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-23 23:18:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:20,489 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-11-23 23:18:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:18:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-23 23:18:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:20,501 INFO L225 Difference]: With dead ends: 114 [2024-11-23 23:18:20,501 INFO L226 Difference]: Without dead ends: 114 [2024-11-23 23:18:20,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:20,510 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 95 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:20,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 90 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-23 23:18:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-23 23:18:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 107 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-23 23:18:20,582 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 3 [2024-11-23 23:18:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:20,584 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-23 23:18:20,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-23 23:18:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-23 23:18:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-23 23:18:20,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:20,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-23 23:18:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:18:20,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:20,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 71564, now seen corresponding path program 1 times [2024-11-23 23:18:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982521917] [2024-11-23 23:18:20,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982521917] [2024-11-23 23:18:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982521917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:18:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788468427] [2024-11-23 23:18:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:18:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:18:21,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:21,196 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-23 23:18:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:21,365 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-23 23:18:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:18:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-23 23:18:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:21,367 INFO L225 Difference]: With dead ends: 113 [2024-11-23 23:18:21,367 INFO L226 Difference]: Without dead ends: 113 [2024-11-23 23:18:21,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:21,368 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:21,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 188 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-23 23:18:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-23 23:18:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-11-23 23:18:21,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 3 [2024-11-23 23:18:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-11-23 23:18:21,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-23 23:18:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-11-23 23:18:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:18:21,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:21,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:21,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:18:21,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:21,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1665984083, now seen corresponding path program 1 times [2024-11-23 23:18:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685022585] [2024-11-23 23:18:21,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685022585] [2024-11-23 23:18:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685022585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:21,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:18:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517718642] [2024-11-23 23:18:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:18:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:21,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:18:21,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:18:21,984 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-23 23:18:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:22,170 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-23 23:18:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:18:22,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-11-23 23:18:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:22,173 INFO L225 Difference]: With dead ends: 117 [2024-11-23 23:18:22,175 INFO L226 Difference]: Without dead ends: 117 [2024-11-23 23:18:22,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:18:22,176 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:22,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 189 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-23 23:18:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-23 23:18:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2024-11-23 23:18:22,194 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 7 [2024-11-23 23:18:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-23 23:18:22,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-23 23:18:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2024-11-23 23:18:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:18:22,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:22,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:18:22,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1963174196, now seen corresponding path program 1 times [2024-11-23 23:18:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370709131] [2024-11-23 23:18:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370709131] [2024-11-23 23:18:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370709131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162176761] [2024-11-23 23:18:22,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:22,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:22,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:22,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:18:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 23:18:23,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:23,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:23,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-23 23:18:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162176761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:23,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-23 23:18:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497044339] [2024-11-23 23:18:23,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:18:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:18:23,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:18:23,686 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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-11-23 23:18:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:24,170 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-23 23:18:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:18:24,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) Word has length 11 [2024-11-23 23:18:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:24,172 INFO L225 Difference]: With dead ends: 121 [2024-11-23 23:18:24,172 INFO L226 Difference]: Without dead ends: 121 [2024-11-23 23:18:24,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:18:24,174 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 203 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:24,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 468 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:18:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-23 23:18:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-23 23:18:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 114 states have internal predecessors, (123), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-23 23:18:24,189 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 11 [2024-11-23 23:18:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:24,190 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-23 23:18:24,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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-11-23 23:18:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-23 23:18:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-23 23:18:24,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:24,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:24,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:18:24,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:24,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2118856001, now seen corresponding path program 1 times [2024-11-23 23:18:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601219514] [2024-11-23 23:18:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601219514] [2024-11-23 23:18:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601219514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086502369] [2024-11-23 23:18:24,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:24,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:24,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:18:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:25,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:18:25,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:25,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086502369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:25,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-23 23:18:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468516746] [2024-11-23 23:18:25,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:25,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:18:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:25,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:18:25,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:18:25,241 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11-23 23:18:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:25,316 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-11-23 23:18:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:18:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) Word has length 19 [2024-11-23 23:18:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:25,317 INFO L225 Difference]: With dead ends: 141 [2024-11-23 23:18:25,317 INFO L226 Difference]: Without dead ends: 141 [2024-11-23 23:18:25,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:18:25,318 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 6 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:25,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 358 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:18:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-23 23:18:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-23 23:18:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.4444444444444444) internal successors, (143), 134 states have internal predecessors, (143), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-11-23 23:18:25,330 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 19 [2024-11-23 23:18:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:25,330 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-11-23 23:18:25,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11-23 23:18:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-11-23 23:18:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-23 23:18:25,332 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:25,332 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:25,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:18:25,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:25,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:25,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 465925276, now seen corresponding path program 2 times [2024-11-23 23:18:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471790731] [2024-11-23 23:18:25,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:18:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:25,646 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:18:25,646 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:18:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-23 23:18:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471790731] [2024-11-23 23:18:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471790731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:18:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292225141] [2024-11-23 23:18:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:18:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:26,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:18:26,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:26,030 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-23 23:18:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:26,160 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2024-11-23 23:18:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:18:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 39 [2024-11-23 23:18:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:26,162 INFO L225 Difference]: With dead ends: 140 [2024-11-23 23:18:26,162 INFO L226 Difference]: Without dead ends: 140 [2024-11-23 23:18:26,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:26,163 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:26,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 92 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:18:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-23 23:18:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-23 23:18:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 133 states have internal predecessors, (142), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2024-11-23 23:18:26,171 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 39 [2024-11-23 23:18:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:26,171 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2024-11-23 23:18:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-23 23:18:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2024-11-23 23:18:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-23 23:18:26,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:26,172 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:26,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:18:26,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:26,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 465925277, now seen corresponding path program 1 times [2024-11-23 23:18:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072878330] [2024-11-23 23:18:26,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072878330] [2024-11-23 23:18:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072878330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205273959] [2024-11-23 23:18:26,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:26,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:26,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:26,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:18:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:27,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 23:18:27,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:27,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205273959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:27,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-23 23:18:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802401419] [2024-11-23 23:18:27,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:18:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:27,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:18:27,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:18:27,432 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-11-23 23:18:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:27,521 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2024-11-23 23:18:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:18:27,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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) Word has length 39 [2024-11-23 23:18:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:27,523 INFO L225 Difference]: With dead ends: 148 [2024-11-23 23:18:27,523 INFO L226 Difference]: Without dead ends: 148 [2024-11-23 23:18:27,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:18:27,524 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:27,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 584 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:18:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-23 23:18:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-23 23:18:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 141 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2024-11-23 23:18:27,536 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 39 [2024-11-23 23:18:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:27,536 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2024-11-23 23:18:27,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-11-23 23:18:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2024-11-23 23:18:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:18:27,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:27,537 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:27,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:18:27,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-23 23:18:27,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1749604081, now seen corresponding path program 2 times [2024-11-23 23:18:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625425435] [2024-11-23 23:18:27,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:18:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:27,824 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:18:27,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:18:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625425435] [2024-11-23 23:18:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625425435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:18:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150024577] [2024-11-23 23:18:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:18:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:28,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:18:28,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:18:28,189 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-23 23:18:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:28,402 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2024-11-23 23:18:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:18:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 47 [2024-11-23 23:18:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:28,407 INFO L225 Difference]: With dead ends: 147 [2024-11-23 23:18:28,407 INFO L226 Difference]: Without dead ends: 147 [2024-11-23 23:18:28,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:28,408 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 290 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:28,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 69 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-23 23:18:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-23 23:18:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 140 states have internal predecessors, (149), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2024-11-23 23:18:28,422 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 47 [2024-11-23 23:18:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:28,424 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-23 23:18:28,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-23 23:18:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2024-11-23 23:18:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-23 23:18:28,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:28,425 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:28,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:18:28,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:28,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -877789315, now seen corresponding path program 1 times [2024-11-23 23:18:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:28,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252108306] [2024-11-23 23:18:28,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252108306] [2024-11-23 23:18:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252108306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:18:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654341647] [2024-11-23 23:18:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:18:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:28,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:18:28,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:28,907 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:29,027 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2024-11-23 23:18:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:18:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-23 23:18:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:29,029 INFO L225 Difference]: With dead ends: 142 [2024-11-23 23:18:29,029 INFO L226 Difference]: Without dead ends: 142 [2024-11-23 23:18:29,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:18:29,030 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 73 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:29,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 98 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:18:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-23 23:18:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-23 23:18:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 135 states have internal predecessors, (144), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-11-23 23:18:29,044 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 55 [2024-11-23 23:18:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:29,045 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-23 23:18:29,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2024-11-23 23:18:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-23 23:18:29,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:29,047 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:29,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:18:29,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash -877789314, now seen corresponding path program 1 times [2024-11-23 23:18:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089197593] [2024-11-23 23:18:29,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089197593] [2024-11-23 23:18:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089197593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:30,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:30,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:18:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936136532] [2024-11-23 23:18:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:18:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:30,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:18:30,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:30,200 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:30,437 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2024-11-23 23:18:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:18:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-23 23:18:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:30,439 INFO L225 Difference]: With dead ends: 144 [2024-11-23 23:18:30,440 INFO L226 Difference]: Without dead ends: 144 [2024-11-23 23:18:30,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:30,440 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:30,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 386 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-23 23:18:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-11-23 23:18:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 134 states have internal predecessors, (143), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-11-23 23:18:30,450 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 55 [2024-11-23 23:18:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:30,451 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-11-23 23:18:30,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-11-23 23:18:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-23 23:18:30,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:30,453 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:30,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:18:30,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:30,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1032694853, now seen corresponding path program 1 times [2024-11-23 23:18:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262238934] [2024-11-23 23:18:30,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262238934] [2024-11-23 23:18:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262238934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:31,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:31,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:18:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18158377] [2024-11-23 23:18:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:18:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:31,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:18:31,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:31,080 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:31,396 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2024-11-23 23:18:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:18:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-23 23:18:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:31,398 INFO L225 Difference]: With dead ends: 162 [2024-11-23 23:18:31,398 INFO L226 Difference]: Without dead ends: 162 [2024-11-23 23:18:31,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:31,399 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 99 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:31,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 212 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:18:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-23 23:18:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2024-11-23 23:18:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.360655737704918) internal successors, (166), 149 states have internal predecessors, (166), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2024-11-23 23:18:31,405 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 59 [2024-11-23 23:18:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:31,406 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2024-11-23 23:18:31,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2024-11-23 23:18:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-23 23:18:31,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:31,407 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:31,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:18:31,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:31,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1032698150, now seen corresponding path program 1 times [2024-11-23 23:18:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:31,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575118669] [2024-11-23 23:18:31,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575118669] [2024-11-23 23:18:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575118669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:31,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:18:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099318567] [2024-11-23 23:18:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:18:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:31,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:18:31,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:18:31,822 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:32,003 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2024-11-23 23:18:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:18:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-23 23:18:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:32,004 INFO L225 Difference]: With dead ends: 155 [2024-11-23 23:18:32,005 INFO L226 Difference]: Without dead ends: 155 [2024-11-23 23:18:32,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:18:32,005 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:32,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-23 23:18:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-23 23:18:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 148 states have internal predecessors, (165), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2024-11-23 23:18:32,015 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 59 [2024-11-23 23:18:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:32,016 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2024-11-23 23:18:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2024-11-23 23:18:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-23 23:18:32,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:32,018 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:18:32,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1032698151, now seen corresponding path program 1 times [2024-11-23 23:18:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786813508] [2024-11-23 23:18:32,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786813508] [2024-11-23 23:18:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786813508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:32,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:18:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931173550] [2024-11-23 23:18:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:32,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:18:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:32,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:18:32,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:32,530 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:32,644 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2024-11-23 23:18:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:18:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-23 23:18:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:32,645 INFO L225 Difference]: With dead ends: 161 [2024-11-23 23:18:32,646 INFO L226 Difference]: Without dead ends: 161 [2024-11-23 23:18:32,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:18:32,646 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 108 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:32,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 389 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:18:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-23 23:18:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2024-11-23 23:18:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 148 states have internal predecessors, (164), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2024-11-23 23:18:32,652 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 59 [2024-11-23 23:18:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:32,652 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2024-11-23 23:18:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2024-11-23 23:18:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-23 23:18:32,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:32,654 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:32,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:18:32,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 161654300, now seen corresponding path program 1 times [2024-11-23 23:18:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:32,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165637489] [2024-11-23 23:18:32,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165637489] [2024-11-23 23:18:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165637489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:33,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:18:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980711293] [2024-11-23 23:18:33,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:33,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:18:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:33,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:18:33,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:18:33,774 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:34,300 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2024-11-23 23:18:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:18:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-23 23:18:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:34,302 INFO L225 Difference]: With dead ends: 162 [2024-11-23 23:18:34,302 INFO L226 Difference]: Without dead ends: 162 [2024-11-23 23:18:34,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:18:34,303 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 182 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:34,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 230 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:18:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-23 23:18:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2024-11-23 23:18:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.319672131147541) internal successors, (161), 147 states have internal predecessors, (161), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2024-11-23 23:18:34,310 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 62 [2024-11-23 23:18:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2024-11-23 23:18:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2024-11-23 23:18:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 23:18:34,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:34,312 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 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-11-23 23:18:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:18:34,312 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1184949259, now seen corresponding path program 1 times [2024-11-23 23:18:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979823951] [2024-11-23 23:18:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:35,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979823951] [2024-11-23 23:18:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979823951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:35,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:35,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:18:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388111744] [2024-11-23 23:18:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:35,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:18:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:35,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:18:35,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:18:35,137 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:35,386 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2024-11-23 23:18:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:18:35,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-23 23:18:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:35,389 INFO L225 Difference]: With dead ends: 153 [2024-11-23 23:18:35,389 INFO L226 Difference]: Without dead ends: 153 [2024-11-23 23:18:35,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:18:35,390 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 78 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:35,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 301 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-23 23:18:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-23 23:18:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 146 states have internal predecessors, (159), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2024-11-23 23:18:35,404 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 65 [2024-11-23 23:18:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2024-11-23 23:18:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2024-11-23 23:18:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 23:18:35,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:35,405 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 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-11-23 23:18:35,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:18:35,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1184949260, now seen corresponding path program 1 times [2024-11-23 23:18:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810060831] [2024-11-23 23:18:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810060831] [2024-11-23 23:18:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810060831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:18:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332204297] [2024-11-23 23:18:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:18:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:36,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:18:36,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:18:36,434 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:36,698 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2024-11-23 23:18:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:18:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-23 23:18:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:36,700 INFO L225 Difference]: With dead ends: 152 [2024-11-23 23:18:36,700 INFO L226 Difference]: Without dead ends: 152 [2024-11-23 23:18:36,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:18:36,701 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:36,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 367 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:18:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-23 23:18:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-23 23:18:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 145 states have internal predecessors, (157), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2024-11-23 23:18:36,711 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 65 [2024-11-23 23:18:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:36,712 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2024-11-23 23:18:36,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2024-11-23 23:18:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-23 23:18:36,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:36,714 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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-11-23 23:18:36,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 23:18:36,715 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:36,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash 88824324, now seen corresponding path program 1 times [2024-11-23 23:18:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:36,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050120880] [2024-11-23 23:18:36,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050120880] [2024-11-23 23:18:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050120880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:18:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652125714] [2024-11-23 23:18:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:18:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:37,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:18:37,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:18:37,725 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:38,158 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2024-11-23 23:18:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:18:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-23 23:18:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:38,159 INFO L225 Difference]: With dead ends: 162 [2024-11-23 23:18:38,160 INFO L226 Difference]: Without dead ends: 162 [2024-11-23 23:18:38,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:18:38,160 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 166 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:38,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 383 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:18:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-23 23:18:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-11-23 23:18:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 153 states have internal predecessors, (170), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2024-11-23 23:18:38,170 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 70 [2024-11-23 23:18:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2024-11-23 23:18:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2024-11-23 23:18:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-23 23:18:38,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:38,171 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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-11-23 23:18:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 23:18:38,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:38,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 88824325, now seen corresponding path program 1 times [2024-11-23 23:18:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056046055] [2024-11-23 23:18:38,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056046055] [2024-11-23 23:18:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056046055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:18:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466419199] [2024-11-23 23:18:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:18:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:18:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:18:39,687 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:40,150 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2024-11-23 23:18:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:18:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-23 23:18:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:40,152 INFO L225 Difference]: With dead ends: 160 [2024-11-23 23:18:40,152 INFO L226 Difference]: Without dead ends: 160 [2024-11-23 23:18:40,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:18:40,153 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 90 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:40,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 294 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:18:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-23 23:18:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-23 23:18:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 153 states have internal predecessors, (166), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2024-11-23 23:18:40,159 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 70 [2024-11-23 23:18:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:40,159 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-11-23 23:18:40,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2024-11-23 23:18:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-23 23:18:40,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:40,160 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:40,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 23:18:40,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 834160444, now seen corresponding path program 1 times [2024-11-23 23:18:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20146957] [2024-11-23 23:18:40,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20146957] [2024-11-23 23:18:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20146957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006827724] [2024-11-23 23:18:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:41,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:41,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:18:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:41,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 23:18:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:41,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-23 23:18:41,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:18:41,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:18:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-23 23:18:42,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-23 23:18:42,096 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:42,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-23 23:18:42,167 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:42,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-23 23:18:42,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-23 23:18:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:42,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:42,241 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-23 23:18:42,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-23 23:18:42,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-23 23:18:42,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 (Array Int Int))) (not (= (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2084) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-23 23:18:42,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (not (= (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2083))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2084)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-23 23:18:42,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2024-11-23 23:18:42,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 145 [2024-11-23 23:18:42,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-23 23:18:42,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-23 23:18:42,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-23 23:18:42,585 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 23:18:42,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 23:18:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006827724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:42,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:42,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2024-11-23 23:18:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018695069] [2024-11-23 23:18:42,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:42,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-23 23:18:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:42,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 23:18:42,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=251, Unknown=7, NotChecked=102, Total=420 [2024-11-23 23:18:42,607 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:43,324 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2024-11-23 23:18:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:18:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-23 23:18:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:43,326 INFO L225 Difference]: With dead ends: 159 [2024-11-23 23:18:43,327 INFO L226 Difference]: Without dead ends: 159 [2024-11-23 23:18:43,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=362, Unknown=7, NotChecked=126, Total=600 [2024-11-23 23:18:43,328 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 90 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:43,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 611 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 370 Invalid, 0 Unknown, 267 Unchecked, 0.5s Time] [2024-11-23 23:18:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-23 23:18:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-23 23:18:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 152 states have internal predecessors, (164), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2024-11-23 23:18:43,335 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 75 [2024-11-23 23:18:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:43,335 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2024-11-23 23:18:43,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2024-11-23 23:18:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-23 23:18:43,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:43,339 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:43,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:18:43,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:43,543 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:43,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 834160445, now seen corresponding path program 1 times [2024-11-23 23:18:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464030330] [2024-11-23 23:18:43,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464030330] [2024-11-23 23:18:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464030330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940149556] [2024-11-23 23:18:45,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:45,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:45,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:45,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:45,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:18:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:45,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-23 23:18:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:45,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-23 23:18:45,830 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:18:45,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:18:45,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 23:18:45,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-23 23:18:45,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-23 23:18:45,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-23 23:18:45,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-23 23:18:46,111 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:46,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:18:46,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:18:46,272 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:46,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:18:46,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:18:46,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-23 23:18:46,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-23 23:18:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:46,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:46,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2371 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:18:46,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2371 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-23 23:18:47,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2366))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2368))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2367) .cse0 v_ArrVal_2369) .cse1 v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2371 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2366))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2367) .cse5 v_ArrVal_2369) (select (select (store .cse6 .cse5 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2371))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2024-11-23 23:18:47,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:47,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2024-11-23 23:18:47,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:47,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2024-11-23 23:18:47,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5070 treesize of output 4134 [2024-11-23 23:18:47,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2672 treesize of output 2576 [2024-11-23 23:18:47,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 176 [2024-11-23 23:18:47,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 164 [2024-11-23 23:18:47,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 128 [2024-11-23 23:18:47,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2024-11-23 23:18:47,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2024-11-23 23:18:47,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-23 23:18:47,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:47,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2024-11-23 23:18:47,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:47,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2024-11-23 23:18:47,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:18:47,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 61 [2024-11-23 23:18:47,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:18:47,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:18:47,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-23 23:18:47,672 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 23:18:47,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 23:18:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-23 23:18:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940149556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:47,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:47,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2024-11-23 23:18:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841147558] [2024-11-23 23:18:47,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:47,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-23 23:18:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:47,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 23:18:47,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=673, Unknown=24, NotChecked=168, Total=992 [2024-11-23 23:18:47,696 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:49,155 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2024-11-23 23:18:49,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:18:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-23 23:18:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:49,157 INFO L225 Difference]: With dead ends: 169 [2024-11-23 23:18:49,157 INFO L226 Difference]: Without dead ends: 169 [2024-11-23 23:18:49,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=1013, Unknown=24, NotChecked=210, Total=1482 [2024-11-23 23:18:49,158 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:49,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 745 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 649 Invalid, 0 Unknown, 302 Unchecked, 1.0s Time] [2024-11-23 23:18:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-23 23:18:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-23 23:18:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 140 states have (on average 1.25) internal successors, (175), 162 states have internal predecessors, (175), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:18:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2024-11-23 23:18:49,165 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 75 [2024-11-23 23:18:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:49,165 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2024-11-23 23:18:49,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:18:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2024-11-23 23:18:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-23 23:18:49,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:49,166 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:49,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:18:49,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:49,371 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:18:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1259938555, now seen corresponding path program 2 times [2024-11-23 23:18:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302857319] [2024-11-23 23:18:49,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:18:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:49,604 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:18:49,604 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:18:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:51,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302857319] [2024-11-23 23:18:51,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302857319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491950761] [2024-11-23 23:18:51,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:18:51,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:51,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:51,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:51,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:18:52,512 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:18:52,513 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:18:52,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-23 23:18:52,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:52,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-23 23:18:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 23:18:52,581 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:18:52,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:18:52,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-23 23:18:52,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-23 23:18:52,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-23 23:18:52,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-23 23:18:52,845 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:52,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:18:52,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:18:52,996 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:52,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:18:53,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:18:53,170 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:18:53,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:18:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:18:53,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-23 23:18:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-23 23:18:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:18:53,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:53,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2671 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2024-11-23 23:18:53,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2671 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:18:53,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2668))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2669) .cse0 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2669) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2668) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-11-23 23:18:53,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2668))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2669) .cse1 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2669) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2668) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-23 23:18:53,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2668))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2669) .cse1 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2671 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2669) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2668) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-23 23:18:53,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2671 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2666))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2667) .cse0 v_ArrVal_2669) (select (select (store .cse1 .cse0 v_ArrVal_2668) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2671))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2666))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2668))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2667) .cse3 v_ArrVal_2669) .cse4 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-23 23:18:53,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2666))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2668))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2667) .cse1 v_ArrVal_2669) .cse2 v_ArrVal_2671) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2670) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2671 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2666))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2667) .cse6 v_ArrVal_2669) (select (select (store .cse7 .cse6 v_ArrVal_2668) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2671))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2024-11-23 23:19:02,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:02,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2024-11-23 23:19:02,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:02,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2024-11-23 23:19:02,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86702054 treesize of output 73124382 [2024-11-23 23:20:13,184 WARN L286 SmtUtils]: Spent 1.18m on a formula simplification. DAG size of input: 1619 DAG size of output: 535 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:20:14,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6468675 treesize of output 6356539 [2024-11-23 23:20:29,618 WARN L286 SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 1534 DAG size of output: 527 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:20:31,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292543 treesize of output 276223 [2024-11-23 23:20:32,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 276223 treesize of output 264607 [2024-11-23 23:20:34,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264607 treesize of output 250063 [2024-11-23 23:20:35,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250063 treesize of output 210151 [2024-11-23 23:20:36,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210151 treesize of output 170815 [2024-11-23 23:20:38,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170815 treesize of output 151039 [2024-11-23 23:20:39,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151039 treesize of output 146527 [2024-11-23 23:20:41,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146527 treesize of output 144607 [2024-11-23 23:21:25,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:21:25,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2024-11-23 23:21:25,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:21:25,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2024-11-23 23:21:25,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:21:25,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 347 [2024-11-23 23:21:25,289 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:21:25,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:21:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-23 23:21:25,461 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 23:21:25,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 23:21:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 11 not checked. [2024-11-23 23:21:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491950761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:21:25,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:21:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2024-11-23 23:21:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442502691] [2024-11-23 23:21:25,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:21:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-23 23:21:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:21:25,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-23 23:21:25,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=857, Unknown=20, NotChecked=462, Total=1482 [2024-11-23 23:21:25,480 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:21:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:21:28,078 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2024-11-23 23:21:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:21:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2024-11-23 23:21:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:21:28,081 INFO L225 Difference]: With dead ends: 189 [2024-11-23 23:21:28,081 INFO L226 Difference]: Without dead ends: 189 [2024-11-23 23:21:28,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=316, Invalid=1584, Unknown=20, NotChecked=630, Total=2550 [2024-11-23 23:21:28,082 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 132 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 17 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:21:28,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 894 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 789 Invalid, 27 Unknown, 801 Unchecked, 1.5s Time] [2024-11-23 23:21:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-23 23:21:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-23 23:21:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 160 states have (on average 1.24375) internal successors, (199), 182 states have internal predecessors, (199), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:21:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2024-11-23 23:21:28,091 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 80 [2024-11-23 23:21:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:21:28,091 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2024-11-23 23:21:28,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:21:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2024-11-23 23:21:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-23 23:21:28,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:21:28,095 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:21:28,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:21:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-23 23:21:28,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:21:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:21:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 622758738, now seen corresponding path program 1 times [2024-11-23 23:21:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:21:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048626432] [2024-11-23 23:21:28,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:21:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:21:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:21:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:21:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:21:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048626432] [2024-11-23 23:21:28,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048626432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:21:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345143791] [2024-11-23 23:21:28,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:21:28,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:21:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:21:28,598 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:21:28,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:21:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:21:29,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:21:29,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:21:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:21:29,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:21:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:21:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345143791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:21:29,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:21:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-23 23:21:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110518747] [2024-11-23 23:21:29,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:21:29,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:21:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:21:29,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:21:29,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:21:29,313 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:21:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:21:29,407 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2024-11-23 23:21:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:21:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-23 23:21:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:21:29,415 INFO L225 Difference]: With dead ends: 230 [2024-11-23 23:21:29,415 INFO L226 Difference]: Without dead ends: 230 [2024-11-23 23:21:29,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:21:29,417 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 21 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:21:29,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 526 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:21:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-23 23:21:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2024-11-23 23:21:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 194 states have (on average 1.2371134020618557) internal successors, (240), 216 states have internal predecessors, (240), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:21:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2024-11-23 23:21:29,430 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 86 [2024-11-23 23:21:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:21:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2024-11-23 23:21:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:21:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2024-11-23 23:21:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-23 23:21:29,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:21:29,432 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 5, 5, 5, 4, 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] [2024-11-23 23:21:29,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:21:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-23 23:21:29,633 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2024-11-23 23:21:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:21:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -432365563, now seen corresponding path program 3 times [2024-11-23 23:21:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:21:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867773839] [2024-11-23 23:21:29,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:21:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:21:30,028 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-23 23:21:30,028 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:21:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:21:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:21:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867773839] [2024-11-23 23:21:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867773839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:21:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202496496] [2024-11-23 23:21:32,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:21:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:21:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:21:32,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:21:32,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3962b43b-7c59-443e-97f6-614e403d4fe3/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:21:36,060 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-23 23:21:36,061 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:21:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-23 23:21:36,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:21:36,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-23 23:21:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 23:21:36,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:21:36,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:21:36,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-23 23:21:36,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-23 23:21:36,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-23 23:21:36,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-23 23:21:36,635 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:21:36,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:21:36,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:21:36,915 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:21:36,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:21:36,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:21:37,175 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:21:37,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:21:37,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:21:37,448 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-23 23:21:37,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-23 23:21:37,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:21:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:21:37,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2024-11-23 23:21:37,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-23 23:21:37,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-23 23:21:37,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-23 23:21:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 23:21:37,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:21:38,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3301 (Array Int Int))) (or (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (not (= v_ArrVal_3301 (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem165#1.offset| |c_ULTIMATE.start_main_~j~0#1|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base|) .cse1 (select v_ArrVal_3301 .cse1))))))) (forall ((v_ArrVal_3300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2024-11-23 23:21:38,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (or (forall ((v_ArrVal_3301 (Array Int Int))) (or (not (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem165#1.offset_20|))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse2 (select v_ArrVal_3301 .cse2))) v_ArrVal_3301)) (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:21:38,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (or (forall ((v_ArrVal_3301 (Array Int Int))) (or (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (not (= v_ArrVal_3301 (let ((.cse2 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem165#1.offset_20| 1))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse2 (select v_ArrVal_3301 .cse2))))))) (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:21:40,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3296 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_3296))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (v_ArrVal_3300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_3297))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_3298) (select (select (store .cse2 .cse1 v_ArrVal_3299) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3300))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 2) 0)))) (forall ((v_ArrVal_3296 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_3296))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_3297))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_3298))) (or (forall ((v_ArrVal_3301 (Array Int Int))) (let ((.cse7 (store .cse9 .cse10 v_ArrVal_3299))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse5 .cse6 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (not (= (let ((.cse8 (+ |c_ULTIMATE.start_main_~j~0#1| 3 |v_ULTIMATE.start_main_#t~mem165#1.offset_20|))) (store (select .cse7 .cse6) .cse8 (select v_ArrVal_3301 .cse8))) v_ArrVal_3301)))))) (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) (< (+ (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 2) 0))))))) is different from false [2024-11-23 23:21:40,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3294))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3295) .cse5 v_ArrVal_3296))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (v_ArrVal_3300 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3297))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_3298) (select (select (store .cse2 .cse1 v_ArrVal_3299) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3300))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0)))))) (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3294))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3295) .cse14 v_ArrVal_3296))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_3297))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse7 (store .cse6 .cse12 v_ArrVal_3298))) (or (forall ((v_ArrVal_3301 (Array Int Int))) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_3299))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ (select (select (store .cse7 .cse8 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (not (= (let ((.cse10 (+ |c_ULTIMATE.start_main_~j~0#1| 3 |v_ULTIMATE.start_main_#t~mem165#1.offset_20|))) (store (select .cse9 .cse8) .cse10 (select v_ArrVal_3301 .cse10))) v_ArrVal_3301)))))) (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-23 23:21:40,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_3294))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_3295) .cse9 v_ArrVal_3296))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (let ((.cse6 (store .cse8 .cse9 v_ArrVal_3297))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse7 v_ArrVal_3298))) (or (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_3301 (Array Int Int))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3299))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| 3 |v_ULTIMATE.start_main_#t~mem165#1.offset_20|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3301 .cse5))) v_ArrVal_3301)) (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ (select (select (store .cse2 .cse4 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse3 .cse4 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))))) (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_3294))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_3295) .cse15 v_ArrVal_3296))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (v_ArrVal_3300 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_3297))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse11 .cse12 v_ArrVal_3298) (select (select (store .cse13 .cse12 v_ArrVal_3299) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3300))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 4))))))))))) is different from false [2024-11-23 23:21:41,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3293))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_3294))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3292) .cse10 v_ArrVal_3295) .cse9 v_ArrVal_3296))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) 0) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem165#1.offset_20| Int)) (let ((.cse6 (store .cse8 .cse9 v_ArrVal_3297))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse7 v_ArrVal_3298))) (or (< |v_ULTIMATE.start_main_#t~mem165#1.offset_20| (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_3301 (Array Int Int))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3299))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (forall ((v_ArrVal_3300 (Array Int Int))) (<= (+ 5 (select (select (store .cse2 .cse3 v_ArrVal_3300) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_3301) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (not (= (let ((.cse5 (+ 3 |v_ULTIMATE.start_main_#t~mem165#1.offset_20|))) (store (select .cse4 .cse3) .cse5 (select v_ArrVal_3301 .cse5))) v_ArrVal_3301)))))))))))))))))) (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3293))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_3294))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3292) .cse17 v_ArrVal_3295) .cse16 v_ArrVal_3296))) (or (< (+ (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) 0) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (v_ArrVal_3300 (Array Int Int))) (<= 0 (+ 4 (select (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_3297))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse12 .cse13 v_ArrVal_3298) (select (select (store .cse14 .cse13 v_ArrVal_3299) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3300))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))))))) is different from false [2024-11-23 23:21:56,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:21:56,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1045 treesize of output 1033 [2024-11-23 23:21:56,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:21:56,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1021 treesize of output 577 [2024-11-23 23:21:56,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1116886566 treesize of output 923060422 [2024-11-23 23:24:27,809 WARN L286 SmtUtils]: Spent 2.52m on a formula simplification. DAG size of input: 6761 DAG size of output: 477 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:24:28,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 661008593 treesize of output 658415657 [2024-11-23 23:24:39,116 WARN L286 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 8603 DAG size of output: 306 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:24:39,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35499 treesize of output 31431 [2024-11-23 23:24:39,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31431 treesize of output 30441 [2024-11-23 23:24:39,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30441 treesize of output 27513 [2024-11-23 23:24:39,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27513 treesize of output 24651 [2024-11-23 23:24:40,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24862 treesize of output 21670 [2024-11-23 23:24:40,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21670 treesize of output 20872 [2024-11-23 23:24:40,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20872 treesize of output 20602 [2024-11-23 23:24:40,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20602 treesize of output 17836 [2024-11-23 23:24:41,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17836 treesize of output 17548 [2024-11-23 23:24:41,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17493 treesize of output 16269 [2024-11-23 23:24:41,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16269 treesize of output 16131