/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/cast_float_ptr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:41:38,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:41:38,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:41:38,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:41:38,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:41:38,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:41:38,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:41:38,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:41:38,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:41:38,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:41:38,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:41:38,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:41:38,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:41:38,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:41:38,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:41:38,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:41:38,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:41:38,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:41:38,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:41:38,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:41:38,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:41:38,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:41:38,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:41:38,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:41:38,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:41:38,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:41:38,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:41:38,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:41:38,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:41:38,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:41:38,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:41:38,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:41:38,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:41:38,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:41:38,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:41:38,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:41:38,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:41:38,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:41:38,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:41:38,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:41:38,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:41:38,986 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:41:39,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:41:39,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:41:39,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:41:39,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:41:39,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:41:39,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:41:39,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:41:39,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:41:39,052 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:41:39,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:41:39,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:41:39,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:41:39,053 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:41:39,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:41:39,058 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:41:39,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:41:39,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:41:39,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:41:39,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:41:39,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:41:39,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:41:39,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:41:39,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:41:39,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:41:39,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:41:39,061 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:41:39,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:41:39,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:41:39,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:41:39,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:41:39,561 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:41:39,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/cast_float_ptr.c [2022-10-15 16:41:39,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f51a3038/68ec1c7cb8ab43c08921c9335302e7b2/FLAG2f36c825a [2022-10-15 16:41:40,265 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:41:40,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/cast_float_ptr.c [2022-10-15 16:41:40,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f51a3038/68ec1c7cb8ab43c08921c9335302e7b2/FLAG2f36c825a [2022-10-15 16:41:40,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f51a3038/68ec1c7cb8ab43c08921c9335302e7b2 [2022-10-15 16:41:40,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:41:40,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:41:40,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:41:40,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:41:40,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:41:40,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46676334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40, skipping insertion in model container [2022-10-15 16:41:40,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:41:40,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:41:40,844 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/cast_float_ptr.c[362,375] [2022-10-15 16:41:40,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:41:40,877 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:41:40,891 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/cast_float_ptr.c[362,375] [2022-10-15 16:41:40,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:41:40,916 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:41:40,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40 WrapperNode [2022-10-15 16:41:40,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:41:40,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:41:40,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:41:40,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:41:40,928 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:41:40" (1/1) ... [2022-10-15 16:41:40,938 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:41:40" (1/1) ... [2022-10-15 16:41:40,965 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-10-15 16:41:40,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:41:40,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:41:40,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:41:40,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:41:40,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,995 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:40,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:41,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:41:41,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:41:41,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:41:41,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:41:41,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (1/1) ... [2022-10-15 16:41:41,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:41:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:41,048 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:41:41,066 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:41:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:41:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:41:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:41:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:41:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:41:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:41:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:41:41,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:41:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:41:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:41:41,235 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:41:41,238 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:41:41,615 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:41:41,624 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:41:41,624 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:41:41,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:41:41 BoogieIcfgContainer [2022-10-15 16:41:41,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:41:41,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:41:41,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:41:41,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:41:41,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:41:40" (1/3) ... [2022-10-15 16:41:41,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da60e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:41:41, skipping insertion in model container [2022-10-15 16:41:41,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:40" (2/3) ... [2022-10-15 16:41:41,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da60e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:41:41, skipping insertion in model container [2022-10-15 16:41:41,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:41:41" (3/3) ... [2022-10-15 16:41:41,637 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_float_ptr.c [2022-10-15 16:41:41,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:41:41,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-15 16:41:41,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:41:41,782 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;@250e26c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:41:41,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-15 16:41:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 33 states have (on average 2.121212121212121) internal successors, (70), 65 states have internal predecessors, (70), 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:41:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:41:41,815 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:41,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:41:41,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 16:41:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:41,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250370399] [2022-10-15 16:41:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:42,154 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:41:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:42,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250370399] [2022-10-15 16:41:42,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250370399] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:42,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:41:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416824631] [2022-10-15 16:41:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:42,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:42,211 INFO L87 Difference]: Start difference. First operand has 66 states, 33 states have (on average 2.121212121212121) internal successors, (70), 65 states have internal predecessors, (70), 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:41:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:42,312 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-15 16:41:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:42,315 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:41:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:42,326 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:41:42,326 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 16:41:42,328 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:41:42,333 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:42,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 16:41:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-15 16:41:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 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:41:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-10-15 16:41:42,377 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 3 [2022-10-15 16:41:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:42,381 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-10-15 16:41:42,382 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:41:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-10-15 16:41:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:41:42,382 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:42,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:41:42,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:41:42,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 16:41:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518295376] [2022-10-15 16:41:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:42,515 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:41:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:42,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518295376] [2022-10-15 16:41:42,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518295376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:42,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:41:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337714744] [2022-10-15 16:41:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:42,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:42,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:42,521 INFO L87 Difference]: Start difference. First operand 57 states and 60 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:41:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:42,596 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-10-15 16:41:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:42,598 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:41:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:42,601 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:41:42,601 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 16:41:42,605 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:41:42,608 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:42,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 16:41:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-15 16:41:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 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:41:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-10-15 16:41:42,626 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 3 [2022-10-15 16:41:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:42,628 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-10-15 16:41:42,628 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:41:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-10-15 16:41:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:41:42,629 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:42,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:41:42,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:41:42,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-10-15 16:41:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451244128] [2022-10-15 16:41:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:43,115 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:41:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:43,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451244128] [2022-10-15 16:41:43,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451244128] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:43,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:43,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:41:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615623112] [2022-10-15 16:41:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:41:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:41:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:41:43,119 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:41:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:43,201 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-10-15 16:41:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:41:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:43,203 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:41:43,203 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 16:41:43,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:41:43,205 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:43,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 23 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 16:41:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 16:41:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.65625) internal successors, (53), 49 states have internal predecessors, (53), 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:41:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-10-15 16:41:43,213 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 5 [2022-10-15 16:41:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:43,213 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-10-15 16:41:43,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:41:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-10-15 16:41:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:41:43,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:43,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:43,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:41:43,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1803025123, now seen corresponding path program 1 times [2022-10-15 16:41:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90466712] [2022-10-15 16:41:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:43,329 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:41:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90466712] [2022-10-15 16:41:43,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90466712] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:43,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:43,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:41:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108868742] [2022-10-15 16:41:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:43,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:43,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:43,333 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:43,392 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-10-15 16:41:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:43,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:41:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:43,393 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:41:43,393 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:41:43,394 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:41:43,396 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:43,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 26 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:41:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 16:41:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.53125) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-10-15 16:41:43,403 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 7 [2022-10-15 16:41:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:43,403 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-10-15 16:41:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-10-15 16:41:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:41:43,404 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:43,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:43,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:41:43,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1803025124, now seen corresponding path program 1 times [2022-10-15 16:41:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:43,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951452413] [2022-10-15 16:41:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:43,580 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:41:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:43,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951452413] [2022-10-15 16:41:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951452413] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:43,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:41:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317301580] [2022-10-15 16:41:43,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:41:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:41:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:41:43,583 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:43,659 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-10-15 16:41:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:41:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:41:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:43,661 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:41:43,661 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:41:43,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:41:43,663 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:43,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 22 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:41:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-15 16:41:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.40625) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-10-15 16:41:43,669 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 7 [2022-10-15 16:41:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:43,670 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-10-15 16:41:43,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-10-15 16:41:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:41:43,671 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:43,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:43,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:41:43,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 59204365, now seen corresponding path program 1 times [2022-10-15 16:41:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:43,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419079146] [2022-10-15 16:41:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:43,978 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:41:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419079146] [2022-10-15 16:41:43,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419079146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:43,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:41:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469685524] [2022-10-15 16:41:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:43,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:41:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:41:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:41:43,981 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:44,090 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-10-15 16:41:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:41:44,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:41:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:44,092 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:41:44,092 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 16:41:44,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:41:44,094 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:44,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 16:41:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 16:41:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 37 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:41:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-10-15 16:41:44,099 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 8 [2022-10-15 16:41:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:44,100 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-10-15 16:41:44,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-10-15 16:41:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:41:44,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:44,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:44,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:41:44,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1159926518, now seen corresponding path program 1 times [2022-10-15 16:41:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:44,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148005760] [2022-10-15 16:41:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:44,203 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:41:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148005760] [2022-10-15 16:41:44,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148005760] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:44,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:44,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:41:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030081013] [2022-10-15 16:41:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:44,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:44,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:44,206 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:44,241 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-10-15 16:41:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:41:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:44,243 INFO L225 Difference]: With dead ends: 34 [2022-10-15 16:41:44,243 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 16:41:44,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:44,244 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:44,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:41:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 16:41:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 16:41:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 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:41:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-10-15 16:41:44,249 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 12 [2022-10-15 16:41:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:44,249 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-10-15 16:41:44,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-10-15 16:41:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:41:44,251 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:44,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:44,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:41:44,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1159926517, now seen corresponding path program 1 times [2022-10-15 16:41:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:44,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769925230] [2022-10-15 16:41:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:44,322 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:41:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769925230] [2022-10-15 16:41:44,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769925230] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:44,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:44,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:41:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608841224] [2022-10-15 16:41:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:44,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:44,325 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:44,353 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-10-15 16:41:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:44,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:41:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:44,354 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:41:44,354 INFO L226 Difference]: Without dead ends: 23 [2022-10-15 16:41:44,355 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:41:44,356 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:41:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-15 16:41:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-15 16:41:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:41:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-10-15 16:41:44,359 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-10-15 16:41:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:44,360 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-10-15 16:41:44,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-10-15 16:41:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:41:44,361 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:44,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:44,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:41:44,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:41:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -350293787, now seen corresponding path program 1 times [2022-10-15 16:41:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:44,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713454718] [2022-10-15 16:41:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:41:44,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:41:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:41:44,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:41:44,432 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:41:44,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2022-10-15 16:41:44,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2022-10-15 16:41:44,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2022-10-15 16:41:44,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2022-10-15 16:41:44,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2022-10-15 16:41:44,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2022-10-15 16:41:44,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2022-10-15 16:41:44,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2022-10-15 16:41:44,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2022-10-15 16:41:44,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2022-10-15 16:41:44,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2022-10-15 16:41:44,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2022-10-15 16:41:44,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2022-10-15 16:41:44,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2022-10-15 16:41:44,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2022-10-15 16:41:44,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2022-10-15 16:41:44,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2022-10-15 16:41:44,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2022-10-15 16:41:44,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2022-10-15 16:41:44,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2022-10-15 16:41:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2022-10-15 16:41:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2022-10-15 16:41:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2022-10-15 16:41:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2022-10-15 16:41:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2022-10-15 16:41:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2022-10-15 16:41:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2022-10-15 16:41:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2022-10-15 16:41:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2022-10-15 16:41:44,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2022-10-15 16:41:44,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2022-10-15 16:41:44,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2022-10-15 16:41:44,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:41:44,448 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:44,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:41:44,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:41:44 BoogieIcfgContainer [2022-10-15 16:41:44,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:41:44,492 INFO L158 Benchmark]: Toolchain (without parser) took 3851.92ms. Allocated memory is still 153.1MB. Free memory was 127.5MB in the beginning and 65.6MB in the end (delta: 61.8MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,492 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:41:44,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.24ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 117.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.22ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 115.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,493 INFO L158 Benchmark]: Boogie Preprocessor took 33.14ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 114.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,493 INFO L158 Benchmark]: RCFGBuilder took 625.70ms. Allocated memory is still 153.1MB. Free memory was 114.2MB in the beginning and 98.8MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,494 INFO L158 Benchmark]: TraceAbstraction took 2861.92ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 65.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2022-10-15 16:41:44,496 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.18ms. Allocated memory is still 125.8MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.24ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 117.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.22ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 115.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.14ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 114.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 625.70ms. Allocated memory is still 153.1MB. Free memory was 114.2MB in the beginning and 98.8MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2861.92ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 65.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.5MB. 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: 5]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of bitwiseAnd at line 13, overapproximation of memtrack at line 5. Possible FailurePath: [L34] double a; [L35] float r; [L37] a = __VERIFIER_nondet_double() [L38] CALL cast(a) [L10] double dmax; [L11] float f; VAL [\old(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L13] EXPR \read(d) VAL [\old(d)=3758096400, \read(d)=3758096385, d={6:0}, dmax={7:0}, f={5:0}] [L13] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L15] ((unsigned*)&dmax)[0] = 0x47efffff VAL [\old(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L16] ((unsigned*)&dmax)[1] = 0xe0000000 VAL [\old(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L18] EXPR \read(d) VAL [\old(d)=3758096400, \read(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L18] EXPR \read(dmax) VAL [\old(d)=3758096400, \read(d)=3758096400, \read(dmax)=3758096399, d={6:0}, dmax={7:0}, f={5:0}] [L18] COND FALSE !(d > dmax) [L21] EXPR \read(d) VAL [\old(d)=3758096400, \read(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L21] EXPR \read(dmax) VAL [\old(d)=3758096400, \read(d)=3758096400, \read(dmax)=3758096399, d={6:0}, dmax={7:0}, f={5:0}] [L21] COND FALSE !(-d > dmax) [L25] EXPR \read(d) VAL [\old(d)=3758096400, \read(d)=3758096400, d={6:0}, dmax={7:0}, f={5:0}] [L25] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=3758096400, \read(d)=3758096400, d={6:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={7:0}, f={5:0}] [L25] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 32]: 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, 66 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 205 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:41:44,544 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...