./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl --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 32bit --witnessprinter.graph.data.programhash 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:19:20,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:19:20,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:19:20,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:19:20,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:19:21,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:19:21,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:19:21,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:19:21,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:19:21,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:19:21,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:19:21,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:19:21,022 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:19:21,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:19:21,023 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:19:21,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:19:21,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:19:21,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:19:21,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:19:21,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:19:21,027 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:19:21,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:19:21,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:19:21,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:19:21,030 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:19:21,030 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:19:21,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:19:21,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:19:21,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:19:21,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:21,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:19:21,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:19:21,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:19:21,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:19:21,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:19:21,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:19:21,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:19:21,045 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:19:21,049 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_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/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_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 [2023-11-12 02:19:21,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:19:21,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:19:21,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:19:21,380 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:19:21,381 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:19:21,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2023-11-12 02:19:24,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:19:24,789 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:19:24,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2023-11-12 02:19:24,819 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/data/8bbbad939/53ae555c37314331b880d03c372b8227/FLAG955c9a112 [2023-11-12 02:19:24,842 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/data/8bbbad939/53ae555c37314331b880d03c372b8227 [2023-11-12 02:19:24,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:19:24,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:19:24,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:24,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:19:24,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:19:24,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:24" (1/1) ... [2023-11-12 02:19:24,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358314e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:24, skipping insertion in model container [2023-11-12 02:19:24,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:24" (1/1) ... [2023-11-12 02:19:24,924 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:19:25,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:25,253 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:19:25,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:25,341 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:19:25,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25 WrapperNode [2023-11-12 02:19:25,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:25,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:25,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:19:25,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:19:25,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,383 INFO L138 Inliner]: procedures = 112, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2023-11-12 02:19:25,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:25,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:19:25,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:19:25,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:19:25,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:19:25,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:19:25,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:19:25,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:19:25,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (1/1) ... [2023-11-12 02:19:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:25,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:19:25,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:19:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:19:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:19:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:19:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:19:25,601 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:19:25,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:19:25,796 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:19:25,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:19:25,803 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:19:25,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:25 BoogieIcfgContainer [2023-11-12 02:19:25,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:19:25,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:19:25,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:19:25,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:19:25,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:24" (1/3) ... [2023-11-12 02:19:25,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07360b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:25, skipping insertion in model container [2023-11-12 02:19:25,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:25" (2/3) ... [2023-11-12 02:19:25,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07360b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:25, skipping insertion in model container [2023-11-12 02:19:25,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:25" (3/3) ... [2023-11-12 02:19:25,815 INFO L112 eAbstractionObserver]: Analyzing ICFG cmp-freed-ptr.i [2023-11-12 02:19:25,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:19:25,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-12 02:19:25,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:19:25,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4ea4b05b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:19:25,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-12 02:19:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 states have internal predecessors, (25), 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) [2023-11-12 02:19:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 02:19:25,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:25,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 02:19:25,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:25,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2023-11-12 02:19:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784778410] [2023-11-12 02:19:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784778410] [2023-11-12 02:19:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784778410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974426080] [2023-11-12 02:19:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,239 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 states have internal predecessors, (25), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,268 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2023-11-12 02:19:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-12 02:19:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,280 INFO L225 Difference]: With dead ends: 24 [2023-11-12 02:19:26,280 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 02:19:26,282 INFO L412 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 [2023-11-12 02:19:26,288 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:26,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 02:19:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-12 02:19:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 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) [2023-11-12 02:19:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-11-12 02:19:26,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 3 [2023-11-12 02:19:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,323 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-11-12 02:19:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-11-12 02:19:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 02:19:26,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 02:19:26,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:19:26,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2023-11-12 02:19:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813439711] [2023-11-12 02:19:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813439711] [2023-11-12 02:19:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813439711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864795900] [2023-11-12 02:19:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,427 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-12 02:19:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,458 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2023-11-12 02:19:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-12 02:19:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,460 INFO L225 Difference]: With dead ends: 21 [2023-11-12 02:19:26,461 INFO L226 Difference]: Without dead ends: 21 [2023-11-12 02:19:26,461 INFO L412 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 [2023-11-12 02:19:26,464 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 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 [2023-11-12 02:19:26,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-12 02:19:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-12 02:19:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 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) [2023-11-12 02:19:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2023-11-12 02:19:26,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 4 [2023-11-12 02:19:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,476 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2023-11-12 02:19:26,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-12 02:19:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2023-11-12 02:19:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 02:19:26,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:19:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:19:26,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2023-11-12 02:19:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081242079] [2023-11-12 02:19:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081242079] [2023-11-12 02:19:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081242079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949982543] [2023-11-12 02:19:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,617 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-12 02:19:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,634 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2023-11-12 02:19:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-12 02:19:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,636 INFO L225 Difference]: With dead ends: 20 [2023-11-12 02:19:26,636 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 02:19:26,636 INFO L412 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 [2023-11-12 02:19:26,639 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:26,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 02:19:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-12 02:19:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 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) [2023-11-12 02:19:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2023-11-12 02:19:26,644 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 5 [2023-11-12 02:19:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,645 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2023-11-12 02:19:26,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-12 02:19:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2023-11-12 02:19:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:19:26,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:26,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:19:26,646 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949765, now seen corresponding path program 1 times [2023-11-12 02:19:26,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026426515] [2023-11-12 02:19:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026426515] [2023-11-12 02:19:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026426515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486993582] [2023-11-12 02:19:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,736 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. 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) [2023-11-12 02:19:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,750 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-11-12 02:19:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,751 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 [2023-11-12 02:19:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,751 INFO L225 Difference]: With dead ends: 18 [2023-11-12 02:19:26,752 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 02:19:26,752 INFO L412 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 [2023-11-12 02:19:26,753 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:26,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 02:19:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-12 02:19:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 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) [2023-11-12 02:19:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-11-12 02:19:26,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2023-11-12 02:19:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,757 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-11-12 02:19:26,757 INFO L496 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) [2023-11-12 02:19:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-11-12 02:19:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:19:26,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:19:26,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 87867921, now seen corresponding path program 1 times [2023-11-12 02:19:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104078415] [2023-11-12 02:19:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104078415] [2023-11-12 02:19:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104078415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002966197] [2023-11-12 02:19:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,845 INFO L87 Difference]: Start difference. First operand 18 states and 18 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) [2023-11-12 02:19:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,875 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-11-12 02:19:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,875 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 [2023-11-12 02:19:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,876 INFO L225 Difference]: With dead ends: 16 [2023-11-12 02:19:26,876 INFO L226 Difference]: Without dead ends: 16 [2023-11-12 02:19:26,877 INFO L412 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 [2023-11-12 02:19:26,878 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:26,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-12 02:19:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-12 02:19:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 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) [2023-11-12 02:19:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-11-12 02:19:26,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2023-11-12 02:19:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,883 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-11-12 02:19:26,883 INFO L496 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) [2023-11-12 02:19:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-11-12 02:19:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 02:19:26,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:26,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:19:26,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1571061689, now seen corresponding path program 1 times [2023-11-12 02:19:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060142601] [2023-11-12 02:19:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060142601] [2023-11-12 02:19:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060142601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:26,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062448461] [2023-11-12 02:19:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:26,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:26,943 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-12 02:19:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:26,962 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-11-12 02:19:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:26,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-12 02:19:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:26,963 INFO L225 Difference]: With dead ends: 18 [2023-11-12 02:19:26,963 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 02:19:26,964 INFO L412 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 [2023-11-12 02:19:26,965 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:26,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 02:19:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-12 02:19:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 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) [2023-11-12 02:19:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-11-12 02:19:26,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2023-11-12 02:19:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-11-12 02:19:26,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-12 02:19:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-11-12 02:19:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:19:26,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:26,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:26,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:19:26,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:26,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1458272044, now seen corresponding path program 1 times [2023-11-12 02:19:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11794376] [2023-11-12 02:19:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11794376] [2023-11-12 02:19:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11794376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753005271] [2023-11-12 02:19:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:27,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:27,126 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2023-11-12 02:19:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:27,174 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-11-12 02:19:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:19:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 [2023-11-12 02:19:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:27,176 INFO L225 Difference]: With dead ends: 17 [2023-11-12 02:19:27,176 INFO L226 Difference]: Without dead ends: 13 [2023-11-12 02:19:27,176 INFO L412 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 [2023-11-12 02:19:27,177 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:27,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-12 02:19:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-12 02:19:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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) [2023-11-12 02:19:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2023-11-12 02:19:27,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 10 [2023-11-12 02:19:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:27,182 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2023-11-12 02:19:27,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2023-11-12 02:19:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2023-11-12 02:19:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 02:19:27,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:27,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:19:27,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-11-12 02:19:27,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -16437808, now seen corresponding path program 1 times [2023-11-12 02:19:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252674313] [2023-11-12 02:19:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:19:27,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:19:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:19:27,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:19:27,229 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:19:27,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 10 remaining) [2023-11-12 02:19:27,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (8 of 10 remaining) [2023-11-12 02:19:27,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (7 of 10 remaining) [2023-11-12 02:19:27,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 10 remaining) [2023-11-12 02:19:27,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 10 remaining) [2023-11-12 02:19:27,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 10 remaining) [2023-11-12 02:19:27,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2023-11-12 02:19:27,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2023-11-12 02:19:27,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2023-11-12 02:19:27,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-12 02:19:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:19:27,238 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:27,243 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:19:27,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:19:27 BoogieIcfgContainer [2023-11-12 02:19:27,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:19:27,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:19:27,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:19:27,265 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:19:27,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:25" (3/4) ... [2023-11-12 02:19:27,266 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:19:27,303 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:19:27,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:19:27,304 INFO L158 Benchmark]: Toolchain (without parser) took 2450.31ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 68.1MB in the end (delta: 57.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,304 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:19:27,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.19ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 109.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.29ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,305 INFO L158 Benchmark]: Boogie Preprocessor took 24.38ms. Allocated memory is still 169.9MB. Free memory was 107.2MB in the beginning and 106.3MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:19:27,306 INFO L158 Benchmark]: RCFGBuilder took 395.74ms. Allocated memory is still 169.9MB. Free memory was 106.3MB in the beginning and 140.4MB in the end (delta: -34.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,306 INFO L158 Benchmark]: TraceAbstraction took 1456.17ms. Allocated memory is still 169.9MB. Free memory was 139.4MB in the beginning and 70.2MB in the end (delta: 69.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,307 INFO L158 Benchmark]: Witness Printer took 38.62ms. Allocated memory is still 169.9MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:19:27,309 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.25ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.19ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 109.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.29ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.38ms. Allocated memory is still 169.9MB. Free memory was 107.2MB in the beginning and 106.3MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 395.74ms. Allocated memory is still 169.9MB. Free memory was 106.3MB in the beginning and 140.4MB in the end (delta: -34.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1456.17ms. Allocated memory is still 169.9MB. Free memory was 139.4MB in the beginning and 70.2MB in the end (delta: 69.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 38.62ms. Allocated memory is still 169.9MB. Free memory was 70.2MB in the beginning and 68.1MB 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: 554]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L543] struct T* x = ((void *)0); [L544] struct T* y = ((void *)0); [L545] y = malloc(sizeof(*y)) [L546] intptr_t adressY = (intptr_t) y; VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) [L548] x = malloc(sizeof(*x)) [L549] intptr_t adressX = (intptr_t) x; VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L550] COND TRUE adressX == adressY VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: 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, 25 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 100 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:19:27,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c7308a-4bc0-4e6c-b2ef-5e80759782d4/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)