/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:35:07,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:35:07,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:35:07,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:35:07,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:35:07,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:35:07,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:35:07,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:35:07,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:35:07,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:35:07,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:35:07,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:35:07,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:35:07,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:35:07,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:35:07,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:35:07,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:35:07,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:35:07,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:35:07,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:35:07,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:35:07,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:35:07,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:35:07,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:35:07,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:35:07,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:35:07,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:35:07,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:35:07,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:35:07,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:35:07,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:35:07,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:35:07,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:35:07,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:35:07,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:35:07,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:35:07,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:35:07,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:35:07,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:35:07,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:35:07,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:35:07,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-16 01:35:07,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:35:07,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:35:07,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:35:07,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:35:07,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:35:07,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:35:07,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:35:07,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:35:07,935 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:35:07,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:35:07,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:35:07,936 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:35:07,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:35:07,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:35:07,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:35:07,937 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:35:07,937 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:35:07,937 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:35:07,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:35:07,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:35:07,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:35:07,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:35:07,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:35:07,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:35:07,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:35:07,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:35:07,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:35:07,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:35:07,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:35:07,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:35:07,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 01:35:08,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:35:08,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:35:08,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:35:08,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:35:08,414 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:35:08,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2022-10-16 01:35:08,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa01058f8/ab252c7a2441417cab8c14ed9d18ba88/FLAG5ef72b085 [2022-10-16 01:35:09,325 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:35:09,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2022-10-16 01:35:09,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa01058f8/ab252c7a2441417cab8c14ed9d18ba88/FLAG5ef72b085 [2022-10-16 01:35:09,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa01058f8/ab252c7a2441417cab8c14ed9d18ba88 [2022-10-16 01:35:09,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:35:09,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:35:09,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:35:09,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:35:09,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:35:09,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:09" (1/1) ... [2022-10-16 01:35:09,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d46d415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:09, skipping insertion in model container [2022-10-16 01:35:09,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:09" (1/1) ... [2022-10-16 01:35:09,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:35:09,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:35:10,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i[24032,24045] [2022-10-16 01:35:10,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:35:10,066 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:35:10,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i[24032,24045] [2022-10-16 01:35:10,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:35:10,180 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:35:10,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10 WrapperNode [2022-10-16 01:35:10,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:35:10,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:35:10,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:35:10,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:35:10,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,252 INFO L138 Inliner]: procedures = 126, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-10-16 01:35:10,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:35:10,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:35:10,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:35:10,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:35:10,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:35:10,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:35:10,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:35:10,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:35:10,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:35:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:10,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 01:35:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 01:35:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-16 01:35:10,430 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-16 01:35:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:35:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:35:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 01:35:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:35:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 01:35:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 01:35:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:35:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:35:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:35:10,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:35:10,560 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:35:10,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:35:10,669 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-16 01:35:11,409 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:35:11,420 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:35:11,421 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-16 01:35:11,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:11 BoogieIcfgContainer [2022-10-16 01:35:11,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:35:11,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:35:11,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:35:11,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:35:11,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:35:09" (1/3) ... [2022-10-16 01:35:11,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5231df12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:11, skipping insertion in model container [2022-10-16 01:35:11,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (2/3) ... [2022-10-16 01:35:11,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5231df12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:11, skipping insertion in model container [2022-10-16 01:35:11,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:11" (3/3) ... [2022-10-16 01:35:11,434 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-1.i [2022-10-16 01:35:11,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:35:11,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2022-10-16 01:35:11,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:35:11,535 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=FINITE_AUTOMATA, 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;@1dcc9227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:35:11,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2022-10-16 01:35:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 90 states have (on average 2.111111111111111) internal successors, (190), 173 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:35:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:35:11,552 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:11,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:35:11,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 33468268, now seen corresponding path program 1 times [2022-10-16 01:35:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:11,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272885422] [2022-10-16 01:35:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:11,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272885422] [2022-10-16 01:35:11,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272885422] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:11,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:11,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381129588] [2022-10-16 01:35:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:11,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:11,976 INFO L87 Difference]: Start difference. First operand has 175 states, 90 states have (on average 2.111111111111111) internal successors, (190), 173 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 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) [2022-10-16 01:35:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:12,189 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2022-10-16 01:35:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:12,192 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 [2022-10-16 01:35:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:12,203 INFO L225 Difference]: With dead ends: 204 [2022-10-16 01:35:12,203 INFO L226 Difference]: Without dead ends: 198 [2022-10-16 01:35:12,206 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 [2022-10-16 01:35:12,210 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 166 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:12,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 119 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:35:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-10-16 01:35:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-10-16 01:35:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 87 states have (on average 2.0229885057471266) internal successors, (176), 167 states have internal predecessors, (176), 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) [2022-10-16 01:35:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2022-10-16 01:35:12,269 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 5 [2022-10-16 01:35:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:12,270 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2022-10-16 01:35:12,270 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) [2022-10-16 01:35:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2022-10-16 01:35:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:35:12,271 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:12,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:35:12,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:35:12,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 33468269, now seen corresponding path program 1 times [2022-10-16 01:35:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:12,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991711704] [2022-10-16 01:35:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:12,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991711704] [2022-10-16 01:35:12,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991711704] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:12,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:12,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612563466] [2022-10-16 01:35:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:12,464 INFO L87 Difference]: Start difference. First operand 168 states and 176 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) [2022-10-16 01:35:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:12,622 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2022-10-16 01:35:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:12,623 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 [2022-10-16 01:35:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:12,625 INFO L225 Difference]: With dead ends: 167 [2022-10-16 01:35:12,625 INFO L226 Difference]: Without dead ends: 167 [2022-10-16 01:35:12,626 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 [2022-10-16 01:35:12,628 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:12,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:35:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-16 01:35:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-10-16 01:35:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 87 states have (on average 2.0114942528735633) internal successors, (175), 166 states have internal predecessors, (175), 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) [2022-10-16 01:35:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 175 transitions. [2022-10-16 01:35:12,644 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 175 transitions. Word has length 5 [2022-10-16 01:35:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:12,644 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 175 transitions. [2022-10-16 01:35:12,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) [2022-10-16 01:35:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 175 transitions. [2022-10-16 01:35:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 01:35:12,646 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:12,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:12,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:35:12,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 620752485, now seen corresponding path program 1 times [2022-10-16 01:35:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:12,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792245515] [2022-10-16 01:35:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:12,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792245515] [2022-10-16 01:35:12,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792245515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:12,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:12,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:35:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071530277] [2022-10-16 01:35:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:12,742 INFO L87 Difference]: Start difference. First operand 167 states and 175 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) [2022-10-16 01:35:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:13,167 INFO L93 Difference]: Finished difference Result 320 states and 338 transitions. [2022-10-16 01:35:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:35:13,168 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 [2022-10-16 01:35:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:13,171 INFO L225 Difference]: With dead ends: 320 [2022-10-16 01:35:13,171 INFO L226 Difference]: Without dead ends: 320 [2022-10-16 01:35:13,172 INFO L412 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 [2022-10-16 01:35:13,174 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 320 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:13,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 238 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 01:35:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-10-16 01:35:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 171. [2022-10-16 01:35:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.9473684210526316) internal successors, (185), 170 states have internal predecessors, (185), 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) [2022-10-16 01:35:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2022-10-16 01:35:13,203 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 8 [2022-10-16 01:35:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:13,207 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2022-10-16 01:35:13,207 INFO L496 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) [2022-10-16 01:35:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2022-10-16 01:35:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 01:35:13,208 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:13,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:13,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:35:13,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash 620752486, now seen corresponding path program 1 times [2022-10-16 01:35:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:13,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895836686] [2022-10-16 01:35:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895836686] [2022-10-16 01:35:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895836686] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:13,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:13,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:35:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44562600] [2022-10-16 01:35:13,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:13,381 INFO L87 Difference]: Start difference. First operand 171 states and 185 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) [2022-10-16 01:35:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:13,696 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2022-10-16 01:35:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:35:13,697 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 [2022-10-16 01:35:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:13,699 INFO L225 Difference]: With dead ends: 314 [2022-10-16 01:35:13,699 INFO L226 Difference]: Without dead ends: 314 [2022-10-16 01:35:13,699 INFO L412 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 [2022-10-16 01:35:13,701 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 463 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:13,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 171 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 01:35:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-10-16 01:35:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 179. [2022-10-16 01:35:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 103 states have (on average 1.8640776699029127) internal successors, (192), 178 states have internal predecessors, (192), 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) [2022-10-16 01:35:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2022-10-16 01:35:13,713 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 8 [2022-10-16 01:35:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:13,713 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2022-10-16 01:35:13,714 INFO L496 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) [2022-10-16 01:35:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2022-10-16 01:35:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 01:35:13,714 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:13,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:13,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:35:13,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -244401734, now seen corresponding path program 1 times [2022-10-16 01:35:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129844650] [2022-10-16 01:35:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:13,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:13,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129844650] [2022-10-16 01:35:13,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129844650] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:13,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:13,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:35:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556694961] [2022-10-16 01:35:13,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:13,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:13,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:13,795 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-10-16 01:35:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:13,847 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2022-10-16 01:35:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:35:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-10-16 01:35:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:13,849 INFO L225 Difference]: With dead ends: 184 [2022-10-16 01:35:13,849 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 01:35:13,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:35:13,851 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 194 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:13,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 305 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:35:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 01:35:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2022-10-16 01:35:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 103 states have (on average 1.8446601941747574) internal successors, (190), 178 states have internal predecessors, (190), 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) [2022-10-16 01:35:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2022-10-16 01:35:13,862 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 13 [2022-10-16 01:35:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:13,862 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2022-10-16 01:35:13,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-10-16 01:35:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2022-10-16 01:35:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 01:35:13,864 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:13,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:13,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:35:13,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1013521738, now seen corresponding path program 1 times [2022-10-16 01:35:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:13,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188132883] [2022-10-16 01:35:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188132883] [2022-10-16 01:35:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188132883] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:14,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:14,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 01:35:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561192696] [2022-10-16 01:35:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 01:35:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 01:35:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:35:14,136 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand has 7 states, 7 states have (on average 2.0) 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) [2022-10-16 01:35:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:14,262 INFO L93 Difference]: Finished difference Result 201 states and 211 transitions. [2022-10-16 01:35:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:35:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) 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 [2022-10-16 01:35:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:14,284 INFO L225 Difference]: With dead ends: 201 [2022-10-16 01:35:14,285 INFO L226 Difference]: Without dead ends: 201 [2022-10-16 01:35:14,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-16 01:35:14,292 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 42 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:14,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 742 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:35:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-16 01:35:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2022-10-16 01:35:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 104 states have (on average 1.8365384615384615) internal successors, (191), 179 states have internal predecessors, (191), 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) [2022-10-16 01:35:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-10-16 01:35:14,307 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 14 [2022-10-16 01:35:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:14,307 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-10-16 01:35:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) 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) [2022-10-16 01:35:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-10-16 01:35:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 01:35:14,309 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:14,309 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:35:14,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 468354904, now seen corresponding path program 1 times [2022-10-16 01:35:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427029421] [2022-10-16 01:35:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427029421] [2022-10-16 01:35:14,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427029421] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:14,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:35:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946797034] [2022-10-16 01:35:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:14,563 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2022-10-16 01:35:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:15,018 INFO L93 Difference]: Finished difference Result 316 states and 335 transitions. [2022-10-16 01:35:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:35:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) Word has length 16 [2022-10-16 01:35:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:15,020 INFO L225 Difference]: With dead ends: 316 [2022-10-16 01:35:15,021 INFO L226 Difference]: Without dead ends: 316 [2022-10-16 01:35:15,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 01:35:15,026 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 171 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:15,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 776 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 01:35:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-10-16 01:35:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 178. [2022-10-16 01:35:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 104 states have (on average 1.8173076923076923) internal successors, (189), 177 states have internal predecessors, (189), 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) [2022-10-16 01:35:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2022-10-16 01:35:15,034 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 16 [2022-10-16 01:35:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:15,035 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2022-10-16 01:35:15,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2022-10-16 01:35:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2022-10-16 01:35:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 01:35:15,041 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:15,042 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:35:15,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 468354905, now seen corresponding path program 1 times [2022-10-16 01:35:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411181237] [2022-10-16 01:35:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:15,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411181237] [2022-10-16 01:35:15,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411181237] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:15,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:15,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:35:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127002911] [2022-10-16 01:35:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:15,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:15,358 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2022-10-16 01:35:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:15,927 INFO L93 Difference]: Finished difference Result 315 states and 333 transitions. [2022-10-16 01:35:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:35:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) Word has length 16 [2022-10-16 01:35:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:15,930 INFO L225 Difference]: With dead ends: 315 [2022-10-16 01:35:15,930 INFO L226 Difference]: Without dead ends: 315 [2022-10-16 01:35:15,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-10-16 01:35:15,931 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 161 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:15,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 830 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 01:35:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-10-16 01:35:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 168. [2022-10-16 01:35:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 167 states have internal predecessors, (179), 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) [2022-10-16 01:35:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-10-16 01:35:15,939 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 16 [2022-10-16 01:35:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:15,939 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-10-16 01:35:15,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2022-10-16 01:35:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-10-16 01:35:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 01:35:15,941 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:15,941 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:15,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:35:15,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash 210852361, now seen corresponding path program 1 times [2022-10-16 01:35:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:15,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199651477] [2022-10-16 01:35:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:16,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199651477] [2022-10-16 01:35:16,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199651477] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:16,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709726332] [2022-10-16 01:35:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:16,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:35:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 01:35:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:16,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 01:35:16,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:16,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 01:35:16,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 01:35:16,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-10-16 01:35:16,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-10-16 01:35:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:16,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:16,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 21 [2022-10-16 01:35:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:16,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:17,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709726332] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:17,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:17,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2022-10-16 01:35:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169503546] [2022-10-16 01:35:17,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:17,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 01:35:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 01:35:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 01:35:17,170 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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) [2022-10-16 01:35:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:17,521 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2022-10-16 01:35:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:35:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 01:35:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:17,524 INFO L225 Difference]: With dead ends: 181 [2022-10-16 01:35:17,524 INFO L226 Difference]: Without dead ends: 181 [2022-10-16 01:35:17,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-10-16 01:35:17,526 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 373 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:17,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1066 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-10-16 01:35:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-10-16 01:35:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2022-10-16 01:35:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.7843137254901962) internal successors, (182), 170 states have internal predecessors, (182), 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) [2022-10-16 01:35:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-10-16 01:35:17,532 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 17 [2022-10-16 01:35:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:17,532 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-10-16 01:35:17,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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) [2022-10-16 01:35:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-10-16 01:35:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 01:35:17,533 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:17,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:17,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:17,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:17,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2053512678, now seen corresponding path program 1 times [2022-10-16 01:35:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:17,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76201944] [2022-10-16 01:35:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 01:35:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:17,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76201944] [2022-10-16 01:35:17,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76201944] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:17,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:17,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815063594] [2022-10-16 01:35:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:17,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:17,842 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 3 states, 2 states have (on average 9.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) [2022-10-16 01:35:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:17,952 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2022-10-16 01:35:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.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 [2022-10-16 01:35:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:17,954 INFO L225 Difference]: With dead ends: 194 [2022-10-16 01:35:17,954 INFO L226 Difference]: Without dead ends: 194 [2022-10-16 01:35:17,955 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 [2022-10-16 01:35:17,956 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 122 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:17,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 126 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:35:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-10-16 01:35:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2022-10-16 01:35:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 163 states have internal predecessors, (175), 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) [2022-10-16 01:35:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-10-16 01:35:17,964 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 18 [2022-10-16 01:35:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:17,965 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-10-16 01:35:17,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.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) [2022-10-16 01:35:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-10-16 01:35:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 01:35:17,969 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:17,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:17,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:35:17,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2053512677, now seen corresponding path program 1 times [2022-10-16 01:35:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:17,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829519261] [2022-10-16 01:35:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 01:35:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829519261] [2022-10-16 01:35:18,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829519261] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:18,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:18,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932590751] [2022-10-16 01:35:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:18,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:18,137 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 3 states, 2 states have (on average 9.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) [2022-10-16 01:35:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:18,239 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-10-16 01:35:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:18,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.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 [2022-10-16 01:35:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:18,243 INFO L225 Difference]: With dead ends: 157 [2022-10-16 01:35:18,243 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 01:35:18,243 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 [2022-10-16 01:35:18,244 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:18,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 111 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:35:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 01:35:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-10-16 01:35:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 156 states have internal predecessors, (168), 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) [2022-10-16 01:35:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-10-16 01:35:18,252 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 18 [2022-10-16 01:35:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:18,255 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-10-16 01:35:18,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.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) [2022-10-16 01:35:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-10-16 01:35:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 01:35:18,262 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:18,262 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:18,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 01:35:18,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1976437284, now seen corresponding path program 1 times [2022-10-16 01:35:18,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:18,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128024808] [2022-10-16 01:35:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:18,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:18,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128024808] [2022-10-16 01:35:18,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128024808] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:18,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117553497] [2022-10-16 01:35:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:18,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:18,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:35:18,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 01:35:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 01:35:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:18,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:18,554 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 01:35:18,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 01:35:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:35:18,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117553497] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:18,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:18,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-10-16 01:35:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279626728] [2022-10-16 01:35:18,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:18,580 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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) [2022-10-16 01:35:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:18,819 INFO L93 Difference]: Finished difference Result 196 states and 206 transitions. [2022-10-16 01:35:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:35:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 20 [2022-10-16 01:35:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:18,821 INFO L225 Difference]: With dead ends: 196 [2022-10-16 01:35:18,821 INFO L226 Difference]: Without dead ends: 196 [2022-10-16 01:35:18,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:35:18,822 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 169 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:18,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 302 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:35:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-10-16 01:35:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2022-10-16 01:35:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.6372549019607843) internal successors, (167), 156 states have internal predecessors, (167), 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) [2022-10-16 01:35:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-10-16 01:35:18,828 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 20 [2022-10-16 01:35:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:18,828 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-10-16 01:35:18,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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) [2022-10-16 01:35:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-10-16 01:35:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 01:35:18,829 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:18,830 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:18,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:19,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-16 01:35:19,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2022-10-16 01:35:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -980683779, now seen corresponding path program 1 times [2022-10-16 01:35:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:19,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38019428] [2022-10-16 01:35:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:35:19,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:35:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:35:19,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:35:19,143 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:35:19,145 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (81 of 82 remaining) [2022-10-16 01:35:19,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 82 remaining) [2022-10-16 01:35:19,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 82 remaining) [2022-10-16 01:35:19,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 82 remaining) [2022-10-16 01:35:19,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 82 remaining) [2022-10-16 01:35:19,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 82 remaining) [2022-10-16 01:35:19,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 82 remaining) [2022-10-16 01:35:19,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 82 remaining) [2022-10-16 01:35:19,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 82 remaining) [2022-10-16 01:35:19,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 82 remaining) [2022-10-16 01:35:19,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 82 remaining) [2022-10-16 01:35:19,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 82 remaining) [2022-10-16 01:35:19,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 82 remaining) [2022-10-16 01:35:19,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 82 remaining) [2022-10-16 01:35:19,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 82 remaining) [2022-10-16 01:35:19,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 82 remaining) [2022-10-16 01:35:19,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 82 remaining) [2022-10-16 01:35:19,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 82 remaining) [2022-10-16 01:35:19,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 82 remaining) [2022-10-16 01:35:19,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 82 remaining) [2022-10-16 01:35:19,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 82 remaining) [2022-10-16 01:35:19,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 82 remaining) [2022-10-16 01:35:19,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 82 remaining) [2022-10-16 01:35:19,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 82 remaining) [2022-10-16 01:35:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 82 remaining) [2022-10-16 01:35:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 82 remaining) [2022-10-16 01:35:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 82 remaining) [2022-10-16 01:35:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 82 remaining) [2022-10-16 01:35:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 82 remaining) [2022-10-16 01:35:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 82 remaining) [2022-10-16 01:35:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 82 remaining) [2022-10-16 01:35:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 82 remaining) [2022-10-16 01:35:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 82 remaining) [2022-10-16 01:35:19,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 82 remaining) [2022-10-16 01:35:19,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 82 remaining) [2022-10-16 01:35:19,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 82 remaining) [2022-10-16 01:35:19,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 82 remaining) [2022-10-16 01:35:19,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 82 remaining) [2022-10-16 01:35:19,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 82 remaining) [2022-10-16 01:35:19,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 82 remaining) [2022-10-16 01:35:19,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 82 remaining) [2022-10-16 01:35:19,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 82 remaining) [2022-10-16 01:35:19,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 82 remaining) [2022-10-16 01:35:19,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 82 remaining) [2022-10-16 01:35:19,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 82 remaining) [2022-10-16 01:35:19,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 82 remaining) [2022-10-16 01:35:19,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 82 remaining) [2022-10-16 01:35:19,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 82 remaining) [2022-10-16 01:35:19,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 82 remaining) [2022-10-16 01:35:19,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 82 remaining) [2022-10-16 01:35:19,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 82 remaining) [2022-10-16 01:35:19,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 82 remaining) [2022-10-16 01:35:19,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 82 remaining) [2022-10-16 01:35:19,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 82 remaining) [2022-10-16 01:35:19,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 82 remaining) [2022-10-16 01:35:19,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 82 remaining) [2022-10-16 01:35:19,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 82 remaining) [2022-10-16 01:35:19,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 82 remaining) [2022-10-16 01:35:19,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 82 remaining) [2022-10-16 01:35:19,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 82 remaining) [2022-10-16 01:35:19,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 82 remaining) [2022-10-16 01:35:19,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 82 remaining) [2022-10-16 01:35:19,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 82 remaining) [2022-10-16 01:35:19,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 82 remaining) [2022-10-16 01:35:19,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 82 remaining) [2022-10-16 01:35:19,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 82 remaining) [2022-10-16 01:35:19,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 82 remaining) [2022-10-16 01:35:19,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 82 remaining) [2022-10-16 01:35:19,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 82 remaining) [2022-10-16 01:35:19,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 82 remaining) [2022-10-16 01:35:19,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 82 remaining) [2022-10-16 01:35:19,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 82 remaining) [2022-10-16 01:35:19,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 82 remaining) [2022-10-16 01:35:19,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 82 remaining) [2022-10-16 01:35:19,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 82 remaining) [2022-10-16 01:35:19,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (6 of 82 remaining) [2022-10-16 01:35:19,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (5 of 82 remaining) [2022-10-16 01:35:19,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (4 of 82 remaining) [2022-10-16 01:35:19,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (3 of 82 remaining) [2022-10-16 01:35:19,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_FREE (2 of 82 remaining) [2022-10-16 01:35:19,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (1 of 82 remaining) [2022-10-16 01:35:19,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK (0 of 82 remaining) [2022-10-16 01:35:19,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 01:35:19,175 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:19,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:35:19,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:35:19 BoogieIcfgContainer [2022-10-16 01:35:19,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:35:19,243 INFO L158 Benchmark]: Toolchain (without parser) took 9698.29ms. Allocated memory was 156.2MB in the beginning and 226.5MB in the end (delta: 70.3MB). Free memory was 129.5MB in the beginning and 123.4MB in the end (delta: 6.1MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,244 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 156.2MB. Free memory was 125.7MB in the beginning and 125.6MB in the end (delta: 88.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:35:19,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.70ms. Allocated memory is still 156.2MB. Free memory was 129.4MB in the beginning and 112.3MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.48ms. Allocated memory is still 156.2MB. Free memory was 112.3MB in the beginning and 109.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,247 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 156.2MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,247 INFO L158 Benchmark]: RCFGBuilder took 1118.86ms. Allocated memory is still 156.2MB. Free memory was 107.7MB in the beginning and 114.7MB in the end (delta: -7.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,248 INFO L158 Benchmark]: TraceAbstraction took 7816.13ms. Allocated memory was 156.2MB in the beginning and 226.5MB in the end (delta: 70.3MB). Free memory was 113.6MB in the beginning and 123.4MB in the end (delta: -9.8MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. [2022-10-16 01:35:19,256 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 156.2MB. Free memory was 125.7MB in the beginning and 125.6MB in the end (delta: 88.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 628.70ms. Allocated memory is still 156.2MB. Free memory was 129.4MB in the beginning and 112.3MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.48ms. Allocated memory is still 156.2MB. Free memory was 112.3MB in the beginning and 109.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 156.2MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1118.86ms. Allocated memory is still 156.2MB. Free memory was 107.7MB in the beginning and 114.7MB in the end (delta: -7.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7816.13ms. Allocated memory was 156.2MB in the beginning and 226.5MB in the end (delta: 70.3MB). Free memory was 113.6MB in the beginning and 123.4MB in the end (delta: -9.8MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. * 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 - UnprovableResult [Line: 613]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 613. Possible FailurePath: [L596] List a = (List) malloc(sizeof(struct node)); [L597] COND FALSE !(a == 0) VAL [a={-1:0}] [L598] List t; [L599] List p = a; VAL [a={-1:0}, p={-1:0}] [L600] a->h = 2 VAL [a={-1:0}, p={-1:0}] [L601] COND TRUE __VERIFIER_nondet_int() [L602] p->h = 1 VAL [a={-1:0}, p={-1:0}] [L603] t = (List) malloc(sizeof(struct node)) [L604] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L605] p->n = t VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L606] EXPR p->n VAL [a={-1:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L606] p = p->n [L601] COND FALSE !(__VERIFIER_nondet_int()) [L608] p->h = 2 VAL [a={-1:0}, p={-2:0}, t={-2:0}] [L609] p->n = 0 VAL [a={-1:0}, p={-2:0}, t={-2:0}] [L610] p = a VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L611] COND TRUE p!=0 VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L612] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L612] COND TRUE p->h != 2 [L613] reach_error() VAL [a={-1:0}, p={-1:0}, t={-2:0}] - 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: -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: -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: -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: -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: -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: 584]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: 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 2 procedures, 176 locations, 82 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2467 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2467 mSDsluCounter, 4881 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 3297 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2702 IncrementalHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 1584 mSDtfsCounter, 2702 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=6, InterpolantAutomatonStates: 60, 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, 12 MinimizatonAttempts, 704 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 1 QuantifiedInterpolants, 1241 SizeOfPredicates, 13 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 9/18 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 could not prove your program: unable to determine feasibility of some traces [2022-10-16 01:35:19,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...