./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU --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 bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:59:39,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:39,803 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-31 21:59:39,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:39,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:39,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:39,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:39,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:39,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:59:39,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:59:39,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:39,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:39,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:39,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:39,838 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:39,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:39,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:39,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:39,840 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:59:39,841 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:59:39,841 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:59:39,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:39,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:59:39,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:39,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:59:39,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:39,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:39,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:39,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:59:39,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:39,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:39,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:39,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:39,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:39,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:39,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:39,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:39,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:39,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:39,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU 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 -> bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f [2024-10-31 21:59:40,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:40,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:40,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:40,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:40,178 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:40,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i Unable to find full path for "g++" [2024-10-31 21:59:42,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:42,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:42,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2024-10-31 21:59:42,501 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/data/8d9bb7054/899adb0324434ea09fca70c8cbc791fc/FLAGbf2478d77 [2024-10-31 21:59:42,809 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/data/8d9bb7054/899adb0324434ea09fca70c8cbc791fc [2024-10-31 21:59:42,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:42,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:42,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:42,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:42,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:42,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:42" (1/1) ... [2024-10-31 21:59:42,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac60b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:42, skipping insertion in model container [2024-10-31 21:59:42,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:42" (1/1) ... [2024-10-31 21:59:42,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:43,338 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 21:59:43,340 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 21:59:43,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:43,362 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:43,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:43,475 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:43,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43 WrapperNode [2024-10-31 21:59:43,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:43,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:43,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:43,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:43,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,528 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-10-31 21:59:43,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:43,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:43,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:43,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:43,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,563 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-10-31 21:59:43,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:43,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:43,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:43,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:43,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (1/1) ... [2024-10-31 21:59:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:43,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:43,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:43,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:59:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:59:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:59:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:59:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 21:59:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:59:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:43,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:43,790 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:43,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:44,140 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-31 21:59:44,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:44,163 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:44,164 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 21:59:44,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:44 BoogieIcfgContainer [2024-10-31 21:59:44,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:44,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:44,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:44,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:44,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:42" (1/3) ... [2024-10-31 21:59:44,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd160b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:44, skipping insertion in model container [2024-10-31 21:59:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:43" (2/3) ... [2024-10-31 21:59:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd160b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:44, skipping insertion in model container [2024-10-31 21:59:44,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:44" (3/3) ... [2024-10-31 21:59:44,180 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncat_reverse_alloca.i [2024-10-31 21:59:44,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:44,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-31 21:59:44,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:44,287 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;@305ae230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:44,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-31 21:59:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:44,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:44,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031082, now seen corresponding path program 1 times [2024-10-31 21:59:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244395084] [2024-10-31 21:59:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244395084] [2024-10-31 21:59:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244395084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070171087] [2024-10-31 21:59:44,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:44,633 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 39 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-31 21:59:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,702 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-31 21:59:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-31 21:59:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,712 INFO L225 Difference]: With dead ends: 41 [2024-10-31 21:59:44,713 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 21:59:44,715 INFO L431 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-10-31 21:59:44,721 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 65 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 21:59:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 21:59:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-31 21:59:44,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2024-10-31 21:59:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-31 21:59:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-31 21:59:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-31 21:59:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:44,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:44,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031082, now seen corresponding path program 1 times [2024-10-31 21:59:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695250233] [2024-10-31 21:59:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695250233] [2024-10-31 21:59:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695250233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:44,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580989408] [2024-10-31 21:59:44,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:44,952 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-31 21:59:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:45,027 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-31 21:59:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-31 21:59:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:45,028 INFO L225 Difference]: With dead ends: 41 [2024-10-31 21:59:45,029 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 21:59:45,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:45,030 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:45,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 21:59:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 21:59:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-31 21:59:45,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 7 [2024-10-31 21:59:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:45,037 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-31 21:59:45,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-31 21:59:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-31 21:59:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:45,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:45,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:45,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:45,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:45,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1806878124, now seen corresponding path program 1 times [2024-10-31 21:59:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043046753] [2024-10-31 21:59:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:45,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043046753] [2024-10-31 21:59:45,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043046753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:45,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:45,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:45,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078386746] [2024-10-31 21:59:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:45,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:45,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:45,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:45,507 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-10-31 21:59:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:45,571 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-31 21:59:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:45,572 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-10-31 21:59:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:45,573 INFO L225 Difference]: With dead ends: 45 [2024-10-31 21:59:45,573 INFO L226 Difference]: Without dead ends: 45 [2024-10-31 21:59:45,574 INFO L431 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-10-31 21:59:45,575 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:45,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 90 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-31 21:59:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2024-10-31 21:59:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.826086956521739) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-31 21:59:45,581 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 7 [2024-10-31 21:59:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:45,581 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-31 21:59:45,581 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-10-31 21:59:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-31 21:59:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:45,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:45,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:45,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:45,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1806878125, now seen corresponding path program 1 times [2024-10-31 21:59:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420264419] [2024-10-31 21:59:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420264419] [2024-10-31 21:59:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420264419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469936956] [2024-10-31 21:59:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:45,901 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-10-31 21:59:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,013 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-31 21:59:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-10-31 21:59:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,015 INFO L225 Difference]: With dead ends: 36 [2024-10-31 21:59:46,017 INFO L226 Difference]: Without dead ends: 36 [2024-10-31 21:59:46,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:46,020 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-31 21:59:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-31 21:59:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-31 21:59:46,029 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2024-10-31 21:59:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,029 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-31 21:59:46,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-10-31 21:59:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-31 21:59:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 21:59:46,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:46,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:46,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 178646995, now seen corresponding path program 1 times [2024-10-31 21:59:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922952589] [2024-10-31 21:59:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922952589] [2024-10-31 21:59:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922952589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138938961] [2024-10-31 21:59:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:46,104 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,148 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-31 21:59:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-31 21:59:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,149 INFO L225 Difference]: With dead ends: 35 [2024-10-31 21:59:46,151 INFO L226 Difference]: Without dead ends: 35 [2024-10-31 21:59:46,151 INFO L431 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-10-31 21:59:46,152 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-31 21:59:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-31 21:59:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-31 21:59:46,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2024-10-31 21:59:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-31 21:59:46,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-31 21:59:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 21:59:46,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:46,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 178646996, now seen corresponding path program 1 times [2024-10-31 21:59:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203702251] [2024-10-31 21:59:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203702251] [2024-10-31 21:59:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203702251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:46,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218689627] [2024-10-31 21:59:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:46,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:46,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:46,334 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,406 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-10-31 21:59:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-31 21:59:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,408 INFO L225 Difference]: With dead ends: 40 [2024-10-31 21:59:46,408 INFO L226 Difference]: Without dead ends: 40 [2024-10-31 21:59:46,409 INFO L431 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-10-31 21:59:46,410 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-31 21:59:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-10-31 21:59:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-31 21:59:46,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2024-10-31 21:59:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-31 21:59:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-31 21:59:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 21:59:46,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:46,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 180494038, now seen corresponding path program 1 times [2024-10-31 21:59:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895144315] [2024-10-31 21:59:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895144315] [2024-10-31 21:59:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895144315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761149799] [2024-10-31 21:59:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:46,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:46,675 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,781 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-31 21:59:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:46,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2024-10-31 21:59:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,783 INFO L225 Difference]: With dead ends: 38 [2024-10-31 21:59:46,783 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 21:59:46,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:46,785 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 107 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 21:59:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-10-31 21:59:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-31 21:59:46,791 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 8 [2024-10-31 21:59:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,791 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-31 21:59:46,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-31 21:59:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:59:46,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:46,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -118929576, now seen corresponding path program 1 times [2024-10-31 21:59:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281953300] [2024-10-31 21:59:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281953300] [2024-10-31 21:59:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281953300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082361186] [2024-10-31 21:59:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:46,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:46,872 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,945 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-31 21:59:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-31 21:59:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,947 INFO L225 Difference]: With dead ends: 32 [2024-10-31 21:59:46,947 INFO L226 Difference]: Without dead ends: 32 [2024-10-31 21:59:46,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:46,948 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-31 21:59:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-10-31 21:59:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-31 21:59:46,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2024-10-31 21:59:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,959 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-31 21:59:46,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-31 21:59:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:59:46,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:46,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -118929575, now seen corresponding path program 1 times [2024-10-31 21:59:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796623305] [2024-10-31 21:59:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796623305] [2024-10-31 21:59:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796623305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717679900] [2024-10-31 21:59:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:47,528 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:47,676 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-10-31 21:59:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:47,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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 10 [2024-10-31 21:59:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:47,679 INFO L225 Difference]: With dead ends: 45 [2024-10-31 21:59:47,679 INFO L226 Difference]: Without dead ends: 45 [2024-10-31 21:59:47,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:47,680 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:47,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-31 21:59:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-10-31 21:59:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-10-31 21:59:47,688 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 10 [2024-10-31 21:59:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:47,688 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-10-31 21:59:47,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-10-31 21:59:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 21:59:47,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:47,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:47,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1672794898, now seen corresponding path program 1 times [2024-10-31 21:59:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273066315] [2024-10-31 21:59:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273066315] [2024-10-31 21:59:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273066315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589404722] [2024-10-31 21:59:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:47,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:47,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:47,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:47,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:59:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:48,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-31 21:59:48,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:48,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 21:59:48,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 21:59:48,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-31 21:59:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:48,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:48,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-31 21:59:48,358 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 10 treesize of output 8 [2024-10-31 21:59:48,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 14 treesize of output 12 [2024-10-31 21:59:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589404722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:59:48,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:59:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-31 21:59:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669746606] [2024-10-31 21:59:48,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:48,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:59:48,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:48,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:59:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:59:48,370 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:48,661 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2024-10-31 21:59:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 21:59:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 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 12 [2024-10-31 21:59:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:48,664 INFO L225 Difference]: With dead ends: 80 [2024-10-31 21:59:48,666 INFO L226 Difference]: Without dead ends: 80 [2024-10-31 21:59:48,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-31 21:59:48,667 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 81 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:48,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 205 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-31 21:59:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 34. [2024-10-31 21:59:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-31 21:59:48,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 12 [2024-10-31 21:59:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-31 21:59:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-10-31 21:59:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 21:59:48,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:48,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:48,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:59:48,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-31 21:59:48,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1238081954, now seen corresponding path program 1 times [2024-10-31 21:59:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191192307] [2024-10-31 21:59:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191192307] [2024-10-31 21:59:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191192307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054860738] [2024-10-31 21:59:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:48,966 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:49,030 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-31 21:59:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:49,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-10-31 21:59:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:49,032 INFO L225 Difference]: With dead ends: 33 [2024-10-31 21:59:49,033 INFO L226 Difference]: Without dead ends: 33 [2024-10-31 21:59:49,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:49,035 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:49,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-31 21:59:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-31 21:59:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-31 21:59:49,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2024-10-31 21:59:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-31 21:59:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-31 21:59:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 21:59:49,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:49,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:49,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1238081955, now seen corresponding path program 1 times [2024-10-31 21:59:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011721639] [2024-10-31 21:59:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011721639] [2024-10-31 21:59:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011721639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:59:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937639497] [2024-10-31 21:59:49,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:49,317 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:49,400 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-10-31 21:59:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:49,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2024-10-31 21:59:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:49,401 INFO L225 Difference]: With dead ends: 55 [2024-10-31 21:59:49,401 INFO L226 Difference]: Without dead ends: 55 [2024-10-31 21:59:49,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:49,402 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:49,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-31 21:59:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-10-31 21:59:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-10-31 21:59:49,406 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 14 [2024-10-31 21:59:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:49,406 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-10-31 21:59:49,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-10-31 21:59:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 21:59:49,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:49,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:49,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:49,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1939146533, now seen corresponding path program 1 times [2024-10-31 21:59:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869393974] [2024-10-31 21:59:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869393974] [2024-10-31 21:59:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869393974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226146446] [2024-10-31 21:59:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:49,773 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:49,864 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-10-31 21:59:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2024-10-31 21:59:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:49,865 INFO L225 Difference]: With dead ends: 60 [2024-10-31 21:59:49,865 INFO L226 Difference]: Without dead ends: 60 [2024-10-31 21:59:49,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:49,866 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:49,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-31 21:59:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2024-10-31 21:59:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-31 21:59:49,869 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2024-10-31 21:59:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:49,869 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-31 21:59:49,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-10-31 21:59:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 21:59:49,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:49,870 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:49,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:49,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:49,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1646841934, now seen corresponding path program 1 times [2024-10-31 21:59:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913141094] [2024-10-31 21:59:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913141094] [2024-10-31 21:59:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913141094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884509342] [2024-10-31 21:59:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:49,903 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:49,914 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-31 21:59:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-31 21:59:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:49,915 INFO L225 Difference]: With dead ends: 34 [2024-10-31 21:59:49,916 INFO L226 Difference]: Without dead ends: 34 [2024-10-31 21:59:49,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-31 21:59:49,916 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:49,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-31 21:59:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-31 21:59:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-31 21:59:49,919 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2024-10-31 21:59:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:49,920 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-31 21:59:49,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-31 21:59:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 21:59:49,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:49,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:49,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:59:49,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:49,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash -523554743, now seen corresponding path program 1 times [2024-10-31 21:59:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10448236] [2024-10-31 21:59:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:49,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10448236] [2024-10-31 21:59:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10448236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993388736] [2024-10-31 21:59:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:49,998 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:50,033 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-31 21:59:50,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:50,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10-31 21:59:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:50,034 INFO L225 Difference]: With dead ends: 40 [2024-10-31 21:59:50,034 INFO L226 Difference]: Without dead ends: 40 [2024-10-31 21:59:50,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:50,035 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:50,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-31 21:59:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-10-31 21:59:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 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-10-31 21:59:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-31 21:59:50,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2024-10-31 21:59:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:50,038 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-31 21:59:50,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-31 21:59:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:50,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:50,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:50,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:59:50,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:50,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -66128267, now seen corresponding path program 1 times [2024-10-31 21:59:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933713607] [2024-10-31 21:59:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933713607] [2024-10-31 21:59:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933713607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481641929] [2024-10-31 21:59:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:50,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:50,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:50,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:50,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:59:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:50,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-31 21:59:50,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:50,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481641929] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:59:50,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:59:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-31 21:59:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812599084] [2024-10-31 21:59:50,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:50,392 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:50,449 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-31 21:59:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-10-31 21:59:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:50,451 INFO L225 Difference]: With dead ends: 59 [2024-10-31 21:59:50,451 INFO L226 Difference]: Without dead ends: 59 [2024-10-31 21:59:50,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:50,452 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:50,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 149 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-31 21:59:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2024-10-31 21:59:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-10-31 21:59:50,456 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2024-10-31 21:59:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-10-31 21:59:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-10-31 21:59:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:50,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:50,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:50,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 21:59:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-31 21:59:50,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1087196621, now seen corresponding path program 1 times [2024-10-31 21:59:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339138990] [2024-10-31 21:59:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339138990] [2024-10-31 21:59:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339138990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:59:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189665456] [2024-10-31 21:59:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:59:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:59:50,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:50,914 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:50,986 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-10-31 21:59:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:59:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 20 [2024-10-31 21:59:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:50,987 INFO L225 Difference]: With dead ends: 72 [2024-10-31 21:59:50,987 INFO L226 Difference]: Without dead ends: 72 [2024-10-31 21:59:50,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:50,988 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:50,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 155 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-31 21:59:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-10-31 21:59:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-31 21:59:50,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 20 [2024-10-31 21:59:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:50,996 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-31 21:59:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-31 21:59:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:51,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:51,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:51,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:59:51,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1619422773, now seen corresponding path program 1 times [2024-10-31 21:59:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409549314] [2024-10-31 21:59:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409549314] [2024-10-31 21:59:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409549314] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242813270] [2024-10-31 21:59:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:51,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:51,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:51,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 21:59:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-31 21:59:51,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:51,615 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 13 treesize of output 1 [2024-10-31 21:59:51,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 21:59:51,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 21:59:51,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-31 21:59:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:52,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:52,519 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 12 treesize of output 10 [2024-10-31 21:59:52,527 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 20 treesize of output 16 [2024-10-31 21:59:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242813270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:59:52,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:59:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-10-31 21:59:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151209466] [2024-10-31 21:59:52,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-31 21:59:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-31 21:59:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-31 21:59:52,653 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:52,988 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-31 21:59:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:59:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 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 20 [2024-10-31 21:59:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:52,990 INFO L225 Difference]: With dead ends: 72 [2024-10-31 21:59:52,990 INFO L226 Difference]: Without dead ends: 72 [2024-10-31 21:59:52,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2024-10-31 21:59:52,991 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:52,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 348 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-31 21:59:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-10-31 21:59:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2024-10-31 21:59:52,993 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 20 [2024-10-31 21:59:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2024-10-31 21:59:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2024-10-31 21:59:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 21:59:52,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:52,995 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:53,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-31 21:59:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-31 21:59:53,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 250855347, now seen corresponding path program 1 times [2024-10-31 21:59:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721531356] [2024-10-31 21:59:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721531356] [2024-10-31 21:59:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721531356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010080234] [2024-10-31 21:59:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:53,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:53,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 21:59:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:53,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-31 21:59:53,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 21:59:54,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 21:59:54,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-31 21:59:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:54,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:54,516 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-10-31 21:59:54,612 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 13 treesize of output 11 [2024-10-31 21:59:54,617 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 17 treesize of output 12 [2024-10-31 21:59:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010080234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:59:54,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:59:54,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2024-10-31 21:59:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327118736] [2024-10-31 21:59:54,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-31 21:59:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-31 21:59:54,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2024-10-31 21:59:54,692 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:55,407 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2024-10-31 21:59:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 21:59:55,407 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 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 21 [2024-10-31 21:59:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:55,408 INFO L225 Difference]: With dead ends: 107 [2024-10-31 21:59:55,408 INFO L226 Difference]: Without dead ends: 107 [2024-10-31 21:59:55,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2024-10-31 21:59:55,409 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:55,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 318 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:59:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-31 21:59:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-10-31 21:59:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2024-10-31 21:59:55,417 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2024-10-31 21:59:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2024-10-31 21:59:55,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2024-10-31 21:59:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 21:59:55,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:55,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:55,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-31 21:59:55,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:55,625 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 839197646, now seen corresponding path program 1 times [2024-10-31 21:59:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233303277] [2024-10-31 21:59:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233303277] [2024-10-31 21:59:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233303277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202791645] [2024-10-31 21:59:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:55,778 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:55,806 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-10-31 21:59:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-10-31 21:59:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:55,807 INFO L225 Difference]: With dead ends: 86 [2024-10-31 21:59:55,807 INFO L226 Difference]: Without dead ends: 59 [2024-10-31 21:59:55,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:55,808 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:55,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-31 21:59:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-31 21:59:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-31 21:59:55,811 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 22 [2024-10-31 21:59:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:55,811 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-31 21:59:55,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-31 21:59:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 21:59:55,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:55,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 21:59:55,813 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-31 21:59:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -778846502, now seen corresponding path program 1 times [2024-10-31 21:59:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650022357] [2024-10-31 21:59:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:55,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:59:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:55,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:59:55,873 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:59:55,874 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-10-31 21:59:55,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-10-31 21:59:55,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-10-31 21:59:55,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-10-31 21:59:55,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-31 21:59:55,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-31 21:59:55,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-31 21:59:55,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-10-31 21:59:55,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-31 21:59:55,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-10-31 21:59:55,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 21:59:55,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:55,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:59:55,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:59:55 BoogieIcfgContainer [2024-10-31 21:59:55,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:59:55,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:59:55,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:59:55,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:59:55,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:44" (3/4) ... [2024-10-31 21:59:55,923 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 21:59:55,980 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 21:59:55,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:59:55,981 INFO L158 Benchmark]: Toolchain (without parser) took 13166.30ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 102.3MB in the beginning and 64.3MB in the end (delta: 38.0MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,984 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 140.5MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:59:55,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.39ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 81.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.63ms. Allocated memory is still 140.5MB. Free memory was 81.9MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,985 INFO L158 Benchmark]: Boogie Preprocessor took 54.91ms. Allocated memory is still 140.5MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,985 INFO L158 Benchmark]: RCFGBuilder took 579.30ms. Allocated memory is still 140.5MB. Free memory was 77.8MB in the beginning and 61.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,985 INFO L158 Benchmark]: TraceAbstraction took 11752.28ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 66.4MB in the end (delta: -5.4MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,986 INFO L158 Benchmark]: Witness Printer took 59.38ms. Allocated memory is still 211.8MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:59:55,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 140.5MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.39ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 81.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.63ms. Allocated memory is still 140.5MB. Free memory was 81.9MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.91ms. Allocated memory is still 140.5MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.30ms. Allocated memory is still 140.5MB. Free memory was 77.8MB in the beginning and 61.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11752.28ms. Allocated memory was 140.5MB in the beginning and 211.8MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 66.4MB in the end (delta: -5.4MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Witness Printer took 59.38ms. Allocated memory is still 211.8MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L378] int length1 = __VERIFIER_nondet_int(); [L379] int length2 = __VERIFIER_nondet_int(); [L380] int n = __VERIFIER_nondet_int(); [L381] COND FALSE !(length1 < 1) VAL [length1=3, length2=2, n=0] [L384] COND FALSE !(length2 < 1) VAL [length1=3, length2=2, n=0] [L387] COND TRUE n < 1 [L388] n = 1 VAL [length1=3, length2=2, n=1] [L390] COND FALSE !(length1 < n || length1 - n < length2) [L391] char* nondetString1 = (char*) __builtin_alloca(length1 * sizeof(char)); [L392] char* nondetString2 = (char*) __builtin_alloca(length2 * sizeof(char)); VAL [length1=3, length2=2, n=1, nondetString1={6:0}, nondetString2={4:0}] [L393] nondetString1[0] = '\0' [L394] nondetString2[0] = '\0' [L395] nondetString1 += length1 - n - 1 [L396] nondetString2 += length2 - 1 [L397] CALL cstrncat(nondetString1, nondetString2, n) [L366] char *s = s1; VAL [n=1, s1={6:1}, s2={4:1}, s={6:1}] [L367] EXPR \read(*s) [L367] COND TRUE *s != '\0' [L368] s-- VAL [n=1, s1={6:1}, s2={4:1}, s={6:0}] [L367] EXPR \read(*s) [L367] COND FALSE !(*s != '\0') [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=1, s1={6:1}, s2={4:1}, s={6:0}] [L369] n != 0 && (*s = *s2--) != '\0' [L369] EXPR s2-- VAL [n=1, s1={6:1}, s2={4:0}, s={6:0}] [L369] EXPR s2-- [L369] EXPR *s = *s2-- [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=1, s1={6:1}, s2={4:0}, s={6:0}] [L369] COND TRUE n != 0 && (*s = *s2--) != '\0' [L370] n-- [L371] s-- VAL [n=0, s1={6:1}, s2={4:0}, s={6:-1}] [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=0, s1={6:1}, s2={4:0}, s={6:-1}] [L369] n != 0 && (*s = *s2--) != '\0' [L369] COND FALSE !(n != 0 && (*s = *s2--) != '\0') [L373] \read(*s) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 377]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 2385 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1801 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 584 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=19, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 152 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 384 ConstructedInterpolants, 15 QuantifiedInterpolants, 2846 SizeOfPredicates, 22 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 8/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-31 21:59:56,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aac43a53-6f17-4827-87b2-22c752e86f47/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)