/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/float-benchs/interpolation.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:42:12,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:42:12,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:42:12,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:42:12,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:42:12,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:42:12,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:42:12,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:42:12,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:42:12,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:42:12,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:42:12,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:42:12,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:42:12,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:42:12,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:42:12,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:42:12,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:42:12,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:42:12,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:42:12,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:42:12,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:42:12,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:42:12,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:42:12,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:42:12,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:42:12,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:42:12,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:42:12,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:42:12,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:42:12,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:42:12,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:42:12,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:42:12,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:42:12,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:42:12,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:42:12,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:42:12,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:42:12,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:42:12,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:42:12,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:42:12,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:42:12,941 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-15 16:42:12,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:42:12,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:42:12,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:42:12,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:42:12,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:42:12,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:42:13,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:42:13,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:42:13,000 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:42:13,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:42:13,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:42:13,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:42:13,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:42:13,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:42:13,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:42:13,002 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:42:13,002 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:42:13,002 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:42:13,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:42:13,003 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:42:13,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:42:13,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:42:13,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:42:13,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:42:13,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:42:13,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:13,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:42:13,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:42:13,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:42:13,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:42:13,005 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-15 16:42:13,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:42:13,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:42:13,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:42:13,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:42:13,433 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:42:13,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-10-15 16:42:13,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe100a34/b7f63f0359714f68b0032a0f4babed61/FLAG5517e7913 [2022-10-15 16:42:14,262 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:42:14,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-10-15 16:42:14,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe100a34/b7f63f0359714f68b0032a0f4babed61/FLAG5517e7913 [2022-10-15 16:42:14,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe100a34/b7f63f0359714f68b0032a0f4babed61 [2022-10-15 16:42:14,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:42:14,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:42:14,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:14,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:42:14,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:42:14,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:14,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0dea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14, skipping insertion in model container [2022-10-15 16:42:14,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:14,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:42:14,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:42:14,861 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/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-10-15 16:42:14,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:14,885 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:42:14,908 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/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-10-15 16:42:14,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:14,929 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:42:14,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14 WrapperNode [2022-10-15 16:42:14,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:14,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:14,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:42:14,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:42:14,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:14,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,002 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2022-10-15 16:42:15,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:15,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:42:15,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:42:15,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:42:15,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,058 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:42:15,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:42:15,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:42:15,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:42:15,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (1/1) ... [2022-10-15 16:42:15,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:42:15,129 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-15 16:42:15,136 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-15 16:42:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:42:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:42:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:42:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:42:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:42:15,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:42:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:42:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:42:15,346 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:42:15,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:42:15,811 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:42:15,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:42:15,833 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:42:15,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:15 BoogieIcfgContainer [2022-10-15 16:42:15,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:42:15,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:42:15,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:42:15,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:42:15,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:42:14" (1/3) ... [2022-10-15 16:42:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efed263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:15, skipping insertion in model container [2022-10-15 16:42:15,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:14" (2/3) ... [2022-10-15 16:42:15,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efed263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:15, skipping insertion in model container [2022-10-15 16:42:15,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:15" (3/3) ... [2022-10-15 16:42:15,854 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2022-10-15 16:42:15,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:42:15,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 16:42:15,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:42:15,992 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;@708cf374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:42:15,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 16:42:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 22 states have (on average 2.0) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:42:16,007 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:16,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:42:16,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 16:42:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849038198] [2022-10-15 16:42:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:16,404 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-15 16:42:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849038198] [2022-10-15 16:42:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849038198] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:16,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123187072] [2022-10-15 16:42:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:16,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:16,471 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 2.0) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:16,537 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-10-15 16:42:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 16:42:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:16,550 INFO L225 Difference]: With dead ends: 34 [2022-10-15 16:42:16,551 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 16:42:16,553 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-15 16:42:16,558 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:16,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 25 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 16:42:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-15 16:42:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 31 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-15 16:42:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-10-15 16:42:16,601 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 3 [2022-10-15 16:42:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:16,601 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-10-15 16:42:16,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-10-15 16:42:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:42:16,602 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:16,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:42:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:42:16,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 16:42:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:16,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527991020] [2022-10-15 16:42:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:16,812 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-15 16:42:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:16,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527991020] [2022-10-15 16:42:16,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527991020] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:16,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:16,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767411272] [2022-10-15 16:42:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:16,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:16,818 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:16,855 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-10-15 16:42:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 16:42:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:16,857 INFO L225 Difference]: With dead ends: 31 [2022-10-15 16:42:16,857 INFO L226 Difference]: Without dead ends: 31 [2022-10-15 16:42:16,858 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-15 16:42:16,860 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-15 16:42:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-10-15 16:42:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 30 states have internal predecessors, (37), 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-15 16:42:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-10-15 16:42:16,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 3 [2022-10-15 16:42:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-10-15 16:42:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-10-15 16:42:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:16,869 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:16,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:16,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:42:16,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 28693826, now seen corresponding path program 1 times [2022-10-15 16:42:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:16,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711499017] [2022-10-15 16:42:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:17,125 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-15 16:42:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711499017] [2022-10-15 16:42:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711499017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:17,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:17,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:42:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265229304] [2022-10-15 16:42:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:17,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:17,130 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-15 16:42:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:17,188 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-10-15 16:42:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-15 16:42:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:17,190 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:42:17,190 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 16:42:17,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:17,192 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:17,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 16:42:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-15 16:42:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 28 states have internal predecessors, (32), 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-15 16:42:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-10-15 16:42:17,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 5 [2022-10-15 16:42:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:17,199 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-10-15 16:42:17,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-15 16:42:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-10-15 16:42:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:17,200 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:17,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:17,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:42:17,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash 28691874, now seen corresponding path program 1 times [2022-10-15 16:42:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:17,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818631208] [2022-10-15 16:42:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:17,301 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-15 16:42:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:17,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818631208] [2022-10-15 16:42:17,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818631208] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:17,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:17,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497721735] [2022-10-15 16:42:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:17,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:17,306 INFO L87 Difference]: Start difference. First operand 29 states and 32 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-15 16:42:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:17,329 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-10-15 16:42:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:17,330 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-15 16:42:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:17,331 INFO L225 Difference]: With dead ends: 26 [2022-10-15 16:42:17,331 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 16:42:17,331 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-15 16:42:17,333 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:17,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 16:42:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 16:42:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 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-15 16:42:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-10-15 16:42:17,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2022-10-15 16:42:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:17,340 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-10-15 16:42:17,340 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-15 16:42:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-10-15 16:42:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:17,341 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:17,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:17,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:42:17,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 28691875, now seen corresponding path program 1 times [2022-10-15 16:42:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:17,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811369126] [2022-10-15 16:42:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:17,422 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-15 16:42:17,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:17,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811369126] [2022-10-15 16:42:17,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811369126] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:17,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:17,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:17,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159195624] [2022-10-15 16:42:17,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:17,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:17,426 INFO L87 Difference]: Start difference. First operand 26 states and 29 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-15 16:42:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:17,452 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-10-15 16:42:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:17,452 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-15 16:42:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:17,453 INFO L225 Difference]: With dead ends: 25 [2022-10-15 16:42:17,454 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 16:42:17,454 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-15 16:42:17,456 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:17,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 16:42:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-15 16:42:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 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-15 16:42:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-10-15 16:42:17,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2022-10-15 16:42:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:17,463 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-10-15 16:42:17,463 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-15 16:42:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-10-15 16:42:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:42:17,464 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:17,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:17,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:42:17,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1894429895, now seen corresponding path program 1 times [2022-10-15 16:42:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:17,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090320884] [2022-10-15 16:42:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:17,612 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-15 16:42:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090320884] [2022-10-15 16:42:17,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090320884] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:17,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:17,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:42:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723505914] [2022-10-15 16:42:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:17,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:42:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:42:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:17,619 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:17,713 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-10-15 16:42:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:17,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 16:42:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:17,719 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:42:17,719 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 16:42:17,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:17,725 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:17,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 16:42:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-10-15 16:42:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-10-15 16:42:17,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 9 [2022-10-15 16:42:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:17,745 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-10-15 16:42:17,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-10-15 16:42:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:42:17,747 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:17,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:17,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:42:17,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -519005463, now seen corresponding path program 1 times [2022-10-15 16:42:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:17,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130055270] [2022-10-15 16:42:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:17,930 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-15 16:42:17,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:17,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130055270] [2022-10-15 16:42:17,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130055270] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:17,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:17,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:42:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665739694] [2022-10-15 16:42:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:17,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:42:17,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:17,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:42:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:17,937 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:18,010 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-10-15 16:42:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 16:42:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:18,014 INFO L225 Difference]: With dead ends: 39 [2022-10-15 16:42:18,015 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 16:42:18,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:18,018 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 16:42:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-10-15 16:42:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-10-15 16:42:18,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 11 [2022-10-15 16:42:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:18,030 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-10-15 16:42:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-10-15 16:42:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:42:18,032 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:18,032 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:42:18,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1090732219, now seen corresponding path program 1 times [2022-10-15 16:42:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156834851] [2022-10-15 16:42:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:18,182 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-15 16:42:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156834851] [2022-10-15 16:42:18,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156834851] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:42:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176784823] [2022-10-15 16:42:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:42:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:42:18,187 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-15 16:42:18,188 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-15 16:42:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:18,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 16:42:18,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:42:18,438 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-15 16:42:18,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:42:18,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-10-15 16:42:18,664 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-15 16:42:18,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176784823] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:42:18,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:42:18,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-10-15 16:42:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191888161] [2022-10-15 16:42:18,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:42:18,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:42:18,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:42:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:42:18,667 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-15 16:42:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:18,862 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-10-15 16:42:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:42:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:42:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:18,864 INFO L225 Difference]: With dead ends: 76 [2022-10-15 16:42:18,864 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 16:42:18,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:42:18,865 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 350 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:18,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 73 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 16:42:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2022-10-15 16:42:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-10-15 16:42:18,872 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 12 [2022-10-15 16:42:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:18,872 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-10-15 16:42:18,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-15 16:42:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-10-15 16:42:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:42:18,874 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:18,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:18,919 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-15 16:42:19,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:42:19,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash 221641181, now seen corresponding path program 1 times [2022-10-15 16:42:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018589593] [2022-10-15 16:42:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:19,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:19,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018589593] [2022-10-15 16:42:19,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018589593] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:42:19,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932028651] [2022-10-15 16:42:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:42:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:42:19,316 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-15 16:42:19,337 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-15 16:42:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:19,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 16:42:19,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:42:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:42:19,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 16:42:19,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 16:42:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:19,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:42:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:19,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932028651] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:42:19,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:42:19,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-10-15 16:42:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328926681] [2022-10-15 16:42:19,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:42:19,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:42:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:42:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:42:19,691 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:19,870 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-10-15 16:42:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:42:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:42:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:19,872 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:42:19,872 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:42:19,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:42:19,874 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:19,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 95 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:42:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 39. [2022-10-15 16:42:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 38 states have internal predecessors, (47), 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-15 16:42:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-10-15 16:42:19,879 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2022-10-15 16:42:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:19,880 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-10-15 16:42:19,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-10-15 16:42:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:42:19,881 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:19,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:19,926 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-15 16:42:20,095 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,SelfDestructingSolverStorable8 [2022-10-15 16:42:20,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1080367120, now seen corresponding path program 1 times [2022-10-15 16:42:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:20,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509239801] [2022-10-15 16:42:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:20,160 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-15 16:42:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509239801] [2022-10-15 16:42:20,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509239801] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:20,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:20,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:42:20,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359619900] [2022-10-15 16:42:20,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:20,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:42:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:42:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:20,164 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:20,188 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-10-15 16:42:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:42:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:42:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:20,189 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:42:20,189 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 16:42:20,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:42:20,191 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:20,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 16:42:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-15 16:42:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 38 states have internal predecessors, (46), 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-15 16:42:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-10-15 16:42:20,196 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 19 [2022-10-15 16:42:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:20,196 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-10-15 16:42:20,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-10-15 16:42:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:42:20,197 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:20,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:20,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:42:20,198 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:42:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1097377781, now seen corresponding path program 1 times [2022-10-15 16:42:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:20,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495946142] [2022-10-15 16:42:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:20,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:42:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:20,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:42:20,261 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:42:20,262 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-15 16:42:20,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-15 16:42:20,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-15 16:42:20,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-15 16:42:20,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-15 16:42:20,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-15 16:42:20,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-15 16:42:20,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-15 16:42:20,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-15 16:42:20,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-15 16:42:20,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-15 16:42:20,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-15 16:42:20,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-15 16:42:20,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-15 16:42:20,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:42:20,277 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:20,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:42:20,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:42:20 BoogieIcfgContainer [2022-10-15 16:42:20,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:42:20,361 INFO L158 Benchmark]: Toolchain (without parser) took 5758.65ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 132.6MB in the beginning and 120.1MB in the end (delta: 12.5MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,361 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory was 129.1MB in the beginning and 129.1MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:42:20,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.80ms. Allocated memory is still 159.4MB. Free memory was 132.4MB in the beginning and 122.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.94ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,362 INFO L158 Benchmark]: Boogie Preprocessor took 65.84ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,363 INFO L158 Benchmark]: RCFGBuilder took 766.69ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 105.5MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,364 INFO L158 Benchmark]: TraceAbstraction took 4516.81ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 104.9MB in the beginning and 120.1MB in the end (delta: -15.3MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2022-10-15 16:42:20,366 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.27ms. Allocated memory is still 159.4MB. Free memory was 129.1MB in the beginning and 129.1MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.80ms. Allocated memory is still 159.4MB. Free memory was 132.4MB in the beginning and 122.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.94ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.84ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 766.69ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 105.5MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4516.81ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 104.9MB in the beginning and 120.1MB in the end (delta: -15.3MB). Peak memory consumption was 17.9MB. 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: 51]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of memtrack at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; VAL [__return_125=0, __return_main=0, main__max={5:0}, main__min={4:0}] [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0, main__max={5:0}, main__min={4:0}, main__min[0]=57] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0, main__max={5:0}, main__max[4UL]=56, main__min={4:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L31] COND TRUE main__i < 5UL VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__min[main__i]=57] [L36] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}, main__min[main__i]=57] [L36] EXPR main__min[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}, main__min[main__i]=57, main__min[main__i]=57] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4: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: 11]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 909 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 211 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=8, InterpolantAutomatonStates: 43, 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, 10 MinimizatonAttempts, 87 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1150 SizeOfPredicates, 5 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 0/15 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-15 16:42:20,435 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...