/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-newlib/float_req_bl_1270b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:46:05,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:46:05,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:46:05,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:46:05,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:46:05,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:46:05,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:46:05,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:46:05,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:46:05,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:46:05,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:46:05,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:46:05,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:46:05,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:46:05,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:46:05,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:46:05,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:46:05,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:46:05,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:46:05,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:46:05,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:46:05,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:46:05,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:46:05,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:46:05,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:46:05,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:46:05,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:46:05,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:46:05,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:46:05,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:46:05,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:46:05,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:46:05,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:46:05,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:46:05,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:46:05,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:46:05,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:46:05,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:46:05,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:46:05,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:46:05,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:46:05,608 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:46:05,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:46:05,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:46:05,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:46:05,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:46:05,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:46:05,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:46:05,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:46:05,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:46:05,669 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:46:05,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:46:05,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:46:05,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:46:05,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:46:05,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:46:05,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:46:05,672 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:46:05,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:46:05,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:46:05,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:46:05,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:46:05,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:46:05,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:46:05,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:46:05,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:46:05,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:46:05,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:05,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:46:05,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:46:05,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:46:05,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:46:05,675 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:46:06,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:46:06,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:46:06,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:46:06,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:46:06,166 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:46:06,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-10-15 16:46:06,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7687b8e0e/c7af9c5c906c473cb67cceb361628ce6/FLAG89f8c6876 [2022-10-15 16:46:06,913 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:46:06,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-10-15 16:46:06,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7687b8e0e/c7af9c5c906c473cb67cceb361628ce6/FLAG89f8c6876 [2022-10-15 16:46:07,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7687b8e0e/c7af9c5c906c473cb67cceb361628ce6 [2022-10-15 16:46:07,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:46:07,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:46:07,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:07,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:46:07,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:46:07,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebfc6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07, skipping insertion in model container [2022-10-15 16:46:07,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:46:07,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:46:07,708 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-newlib/float_req_bl_1270b.c[4704,4717] [2022-10-15 16:46:07,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:07,727 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:46:07,824 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-newlib/float_req_bl_1270b.c[4704,4717] [2022-10-15 16:46:07,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:07,848 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:46:07,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07 WrapperNode [2022-10-15 16:46:07,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:07,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:07,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:46:07,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:46:07,861 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:46:07" (1/1) ... [2022-10-15 16:46:07,877 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:46:07" (1/1) ... [2022-10-15 16:46:07,932 INFO L138 Inliner]: procedures = 18, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 254 [2022-10-15 16:46:07,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:07,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:46:07,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:46:07,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:46:07,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:46:07,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:46:07,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:46:07,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:46:07,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (1/1) ... [2022-10-15 16:46:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:46:08,029 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:46:08,051 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:46:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:46:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:46:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:46:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:46:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:46:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:46:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:46:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:46:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:46:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:46:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-10-15 16:46:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-10-15 16:46:08,206 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:46:08,208 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:46:09,110 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:46:09,124 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:46:09,125 INFO L300 CfgBuilder]: Removed 34 assume(true) statements. [2022-10-15 16:46:09,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:09 BoogieIcfgContainer [2022-10-15 16:46:09,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:46:09,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:46:09,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:46:09,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:46:09,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:46:07" (1/3) ... [2022-10-15 16:46:09,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214209c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:09, skipping insertion in model container [2022-10-15 16:46:09,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:07" (2/3) ... [2022-10-15 16:46:09,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214209c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:09, skipping insertion in model container [2022-10-15 16:46:09,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:09" (3/3) ... [2022-10-15 16:46:09,139 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2022-10-15 16:46:09,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:46:09,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-10-15 16:46:09,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:46:09,241 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;@6ad4aaf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:46:09,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-10-15 16:46:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 139 states have (on average 1.9424460431654675) internal successors, (270), 205 states have internal predecessors, (270), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:46:09,260 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:09,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:46:09,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:46:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:09,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675819283] [2022-10-15 16:46:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:09,531 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:46:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:09,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675819283] [2022-10-15 16:46:09,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675819283] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:09,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:09,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949653483] [2022-10-15 16:46:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:09,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:09,601 INFO L87 Difference]: Start difference. First operand has 209 states, 139 states have (on average 1.9424460431654675) internal successors, (270), 205 states have internal predecessors, (270), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:09,831 INFO L93 Difference]: Finished difference Result 207 states and 232 transitions. [2022-10-15 16:46:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:46:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:09,849 INFO L225 Difference]: With dead ends: 207 [2022-10-15 16:46:09,850 INFO L226 Difference]: Without dead ends: 205 [2022-10-15 16:46:09,852 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:46:09,857 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:09,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 359 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:46:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-10-15 16:46:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-10-15 16:46:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 138 states have (on average 1.6376811594202898) internal successors, (226), 201 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 230 transitions. [2022-10-15 16:46:09,933 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 230 transitions. Word has length 4 [2022-10-15 16:46:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:09,934 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 230 transitions. [2022-10-15 16:46:09,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 230 transitions. [2022-10-15 16:46:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:46:09,936 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:09,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:46:09,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:46:09,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:46:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:09,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066602279] [2022-10-15 16:46:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:10,072 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:46:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066602279] [2022-10-15 16:46:10,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066602279] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:10,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:10,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685579798] [2022-10-15 16:46:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:10,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:10,078 INFO L87 Difference]: Start difference. First operand 205 states and 230 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:10,225 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2022-10-15 16:46:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:46:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:10,228 INFO L225 Difference]: With dead ends: 203 [2022-10-15 16:46:10,228 INFO L226 Difference]: Without dead ends: 203 [2022-10-15 16:46:10,229 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:46:10,231 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:10,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 372 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-15 16:46:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-10-15 16:46:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 138 states have (on average 1.6231884057971016) internal successors, (224), 199 states have internal predecessors, (224), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2022-10-15 16:46:10,251 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 4 [2022-10-15 16:46:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:10,252 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2022-10-15 16:46:10,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2022-10-15 16:46:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:46:10,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:10,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:10,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:46:10,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1328548690, now seen corresponding path program 1 times [2022-10-15 16:46:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869828934] [2022-10-15 16:46:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:10,433 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:46:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869828934] [2022-10-15 16:46:10,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869828934] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:10,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:10,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267408975] [2022-10-15 16:46:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:10,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:10,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:10,439 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:10,621 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2022-10-15 16:46:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:10,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:46:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:10,624 INFO L225 Difference]: With dead ends: 201 [2022-10-15 16:46:10,624 INFO L226 Difference]: Without dead ends: 201 [2022-10-15 16:46:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:10,633 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:10,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 350 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:46:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-15 16:46:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-10-15 16:46:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 138 states have (on average 1.608695652173913) internal successors, (222), 197 states have internal predecessors, (222), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 226 transitions. [2022-10-15 16:46:10,665 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 226 transitions. Word has length 10 [2022-10-15 16:46:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 226 transitions. [2022-10-15 16:46:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 226 transitions. [2022-10-15 16:46:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:46:10,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:10,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:10,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:46:10,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1328548689, now seen corresponding path program 1 times [2022-10-15 16:46:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:10,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964971849] [2022-10-15 16:46:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:10,824 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:46:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964971849] [2022-10-15 16:46:10,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964971849] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:10,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:10,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341334860] [2022-10-15 16:46:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:10,831 INFO L87 Difference]: Start difference. First operand 201 states and 226 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:10,946 INFO L93 Difference]: Finished difference Result 199 states and 224 transitions. [2022-10-15 16:46:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:46:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:10,949 INFO L225 Difference]: With dead ends: 199 [2022-10-15 16:46:10,949 INFO L226 Difference]: Without dead ends: 199 [2022-10-15 16:46:10,950 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:46:10,961 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-10-15 16:46:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-10-15 16:46:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.5942028985507246) internal successors, (220), 195 states have internal predecessors, (220), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2022-10-15 16:46:10,977 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 10 [2022-10-15 16:46:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:10,977 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2022-10-15 16:46:10,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2022-10-15 16:46:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:46:10,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:10,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:10,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:46:10,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:10,980 INFO L85 PathProgramCache]: Analyzing trace with hash -676796070, now seen corresponding path program 1 times [2022-10-15 16:46:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:10,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814064762] [2022-10-15 16:46:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,078 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:46:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814064762] [2022-10-15 16:46:11,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814064762] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672025382] [2022-10-15 16:46:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,082 INFO L87 Difference]: Start difference. First operand 199 states and 224 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:46:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:11,198 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2022-10-15 16:46:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:11,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:46:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:11,202 INFO L225 Difference]: With dead ends: 197 [2022-10-15 16:46:11,202 INFO L226 Difference]: Without dead ends: 197 [2022-10-15 16:46:11,202 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:46:11,203 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:11,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 344 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-15 16:46:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-10-15 16:46:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 193 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2022-10-15 16:46:11,213 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 17 [2022-10-15 16:46:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:11,213 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2022-10-15 16:46:11,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:46:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2022-10-15 16:46:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:46:11,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:11,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:11,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:46:11,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -676796069, now seen corresponding path program 1 times [2022-10-15 16:46:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:11,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206290304] [2022-10-15 16:46:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,420 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:46:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206290304] [2022-10-15 16:46:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206290304] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143063372] [2022-10-15 16:46:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,424 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:46:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:11,538 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2022-10-15 16:46:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:46:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:11,541 INFO L225 Difference]: With dead ends: 195 [2022-10-15 16:46:11,541 INFO L226 Difference]: Without dead ends: 195 [2022-10-15 16:46:11,542 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:46:11,543 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:11,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 360 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-10-15 16:46:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-10-15 16:46:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 138 states have (on average 1.565217391304348) internal successors, (216), 191 states have internal predecessors, (216), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 220 transitions. [2022-10-15 16:46:11,552 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 220 transitions. Word has length 17 [2022-10-15 16:46:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:11,553 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 220 transitions. [2022-10-15 16:46:11,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:46:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 220 transitions. [2022-10-15 16:46:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:46:11,554 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:11,554 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, 1, 1] [2022-10-15 16:46:11,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:46:11,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash -444440092, now seen corresponding path program 1 times [2022-10-15 16:46:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:11,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808556532] [2022-10-15 16:46:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,667 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:46:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808556532] [2022-10-15 16:46:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808556532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085601038] [2022-10-15 16:46:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,670 INFO L87 Difference]: Start difference. First operand 195 states and 220 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:11,785 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2022-10-15 16:46:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:11,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:46:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:11,788 INFO L225 Difference]: With dead ends: 193 [2022-10-15 16:46:11,788 INFO L226 Difference]: Without dead ends: 193 [2022-10-15 16:46:11,790 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:46:11,792 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:11,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 338 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-10-15 16:46:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-10-15 16:46:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 189 states have internal predecessors, (214), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2022-10-15 16:46:11,800 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 22 [2022-10-15 16:46:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:11,801 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2022-10-15 16:46:11,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-10-15 16:46:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:46:11,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:11,802 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, 1, 1] [2022-10-15 16:46:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:46:11,803 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -444440091, now seen corresponding path program 1 times [2022-10-15 16:46:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750016880] [2022-10-15 16:46:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,979 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:46:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750016880] [2022-10-15 16:46:11,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750016880] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833195785] [2022-10-15 16:46:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,982 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,086 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2022-10-15 16:46:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:46:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,089 INFO L225 Difference]: With dead ends: 191 [2022-10-15 16:46:12,089 INFO L226 Difference]: Without dead ends: 191 [2022-10-15 16:46:12,089 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:46:12,090 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-10-15 16:46:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-10-15 16:46:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 138 states have (on average 1.536231884057971) internal successors, (212), 187 states have internal predecessors, (212), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-10-15 16:46:12,098 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 22 [2022-10-15 16:46:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,098 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-10-15 16:46:12,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-10-15 16:46:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:46:12,100 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:46:12,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1322532790, now seen corresponding path program 1 times [2022-10-15 16:46:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519636817] [2022-10-15 16:46:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,199 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:46:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519636817] [2022-10-15 16:46:12,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519636817] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541972684] [2022-10-15 16:46:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,202 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,315 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2022-10-15 16:46:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 16:46:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,317 INFO L225 Difference]: With dead ends: 189 [2022-10-15 16:46:12,317 INFO L226 Difference]: Without dead ends: 189 [2022-10-15 16:46:12,317 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:46:12,318 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 331 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-10-15 16:46:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-10-15 16:46:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5217391304347827) internal successors, (210), 185 states have internal predecessors, (210), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2022-10-15 16:46:12,325 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 29 [2022-10-15 16:46:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,326 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2022-10-15 16:46:12,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2022-10-15 16:46:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:46:12,327 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:46:12,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1322532791, now seen corresponding path program 1 times [2022-10-15 16:46:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281869488] [2022-10-15 16:46:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,487 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:46:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281869488] [2022-10-15 16:46:12,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281869488] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417911266] [2022-10-15 16:46:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,491 INFO L87 Difference]: Start difference. First operand 189 states and 214 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,592 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2022-10-15 16:46:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 16:46:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,594 INFO L225 Difference]: With dead ends: 187 [2022-10-15 16:46:12,594 INFO L226 Difference]: Without dead ends: 187 [2022-10-15 16:46:12,595 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:46:12,595 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 2 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 348 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-10-15 16:46:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-10-15 16:46:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 183 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2022-10-15 16:46:12,603 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 29 [2022-10-15 16:46:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,603 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2022-10-15 16:46:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2022-10-15 16:46:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:46:12,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:46:12,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1956344669, now seen corresponding path program 1 times [2022-10-15 16:46:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685990543] [2022-10-15 16:46:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,701 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:46:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685990543] [2022-10-15 16:46:12,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685990543] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544451400] [2022-10-15 16:46:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,704 INFO L87 Difference]: Start difference. First operand 187 states and 212 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,831 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2022-10-15 16:46:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:46:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,833 INFO L225 Difference]: With dead ends: 185 [2022-10-15 16:46:12,833 INFO L226 Difference]: Without dead ends: 185 [2022-10-15 16:46:12,834 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:46:12,835 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 326 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-10-15 16:46:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-10-15 16:46:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 181 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2022-10-15 16:46:12,842 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 30 [2022-10-15 16:46:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,842 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2022-10-15 16:46:12,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2022-10-15 16:46:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:46:12,844 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:46:12,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1956344668, now seen corresponding path program 1 times [2022-10-15 16:46:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983129323] [2022-10-15 16:46:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,033 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:46:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983129323] [2022-10-15 16:46:13,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983129323] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443054242] [2022-10-15 16:46:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,036 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,124 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2022-10-15 16:46:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:46:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,127 INFO L225 Difference]: With dead ends: 183 [2022-10-15 16:46:13,127 INFO L226 Difference]: Without dead ends: 183 [2022-10-15 16:46:13,127 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:46:13,128 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 342 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-10-15 16:46:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-10-15 16:46:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 179 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2022-10-15 16:46:13,135 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 30 [2022-10-15 16:46:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,135 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2022-10-15 16:46:13,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2022-10-15 16:46:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:13,137 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:46:13,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1473586216, now seen corresponding path program 1 times [2022-10-15 16:46:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722445249] [2022-10-15 16:46:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,224 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:46:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722445249] [2022-10-15 16:46:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722445249] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589995614] [2022-10-15 16:46:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,227 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,323 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2022-10-15 16:46:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,325 INFO L225 Difference]: With dead ends: 181 [2022-10-15 16:46:13,325 INFO L226 Difference]: Without dead ends: 181 [2022-10-15 16:46:13,325 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:46:13,326 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 320 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-10-15 16:46:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-10-15 16:46:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 138 states have (on average 1.463768115942029) internal successors, (202), 177 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 206 transitions. [2022-10-15 16:46:13,333 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 206 transitions. Word has length 32 [2022-10-15 16:46:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,333 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 206 transitions. [2022-10-15 16:46:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 206 transitions. [2022-10-15 16:46:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:13,335 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:46:13,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1473586215, now seen corresponding path program 1 times [2022-10-15 16:46:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12916354] [2022-10-15 16:46:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,465 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:46:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12916354] [2022-10-15 16:46:13,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12916354] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537960968] [2022-10-15 16:46:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,468 INFO L87 Difference]: Start difference. First operand 181 states and 206 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,550 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2022-10-15 16:46:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,552 INFO L225 Difference]: With dead ends: 179 [2022-10-15 16:46:13,552 INFO L226 Difference]: Without dead ends: 179 [2022-10-15 16:46:13,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,554 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 336 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-15 16:46:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-10-15 16:46:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 175 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2022-10-15 16:46:13,562 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 32 [2022-10-15 16:46:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,562 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2022-10-15 16:46:13,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2022-10-15 16:46:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:13,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:46:13,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1473564370, now seen corresponding path program 1 times [2022-10-15 16:46:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570137872] [2022-10-15 16:46:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,692 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:46:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570137872] [2022-10-15 16:46:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570137872] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503512494] [2022-10-15 16:46:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,695 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,791 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2022-10-15 16:46:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,793 INFO L225 Difference]: With dead ends: 177 [2022-10-15 16:46:13,793 INFO L226 Difference]: Without dead ends: 177 [2022-10-15 16:46:13,794 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:46:13,795 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 314 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-15 16:46:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-10-15 16:46:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.434782608695652) internal successors, (198), 173 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 202 transitions. [2022-10-15 16:46:13,801 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 202 transitions. Word has length 32 [2022-10-15 16:46:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,802 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 202 transitions. [2022-10-15 16:46:13,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2022-10-15 16:46:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:13,803 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:46:13,803 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1473564369, now seen corresponding path program 1 times [2022-10-15 16:46:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122311017] [2022-10-15 16:46:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,960 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:46:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122311017] [2022-10-15 16:46:13,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122311017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227063904] [2022-10-15 16:46:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,963 INFO L87 Difference]: Start difference. First operand 177 states and 202 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:14,054 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2022-10-15 16:46:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:14,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:14,056 INFO L225 Difference]: With dead ends: 175 [2022-10-15 16:46:14,056 INFO L226 Difference]: Without dead ends: 175 [2022-10-15 16:46:14,057 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:46:14,057 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:14,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 330 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-10-15 16:46:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-10-15 16:46:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 171 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2022-10-15 16:46:14,064 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 32 [2022-10-15 16:46:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:14,064 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2022-10-15 16:46:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2022-10-15 16:46:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:14,065 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:14,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:14,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:46:14,066 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1407831523, now seen corresponding path program 1 times [2022-10-15 16:46:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:14,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808220869] [2022-10-15 16:46:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:14,152 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:46:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:14,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808220869] [2022-10-15 16:46:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808220869] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:14,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:14,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644770422] [2022-10-15 16:46:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:14,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:14,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:14,155 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:14,263 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2022-10-15 16:46:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:14,265 INFO L225 Difference]: With dead ends: 173 [2022-10-15 16:46:14,265 INFO L226 Difference]: Without dead ends: 173 [2022-10-15 16:46:14,266 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:46:14,266 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:14,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-10-15 16:46:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-10-15 16:46:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 169 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-10-15 16:46:14,273 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 32 [2022-10-15 16:46:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:14,273 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-10-15 16:46:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-10-15 16:46:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:14,274 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:14,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:46:14,275 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1407831522, now seen corresponding path program 1 times [2022-10-15 16:46:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:14,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465425669] [2022-10-15 16:46:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:14,418 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:46:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:14,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465425669] [2022-10-15 16:46:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465425669] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:14,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287346001] [2022-10-15 16:46:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:14,421 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:14,534 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-10-15 16:46:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:14,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:14,536 INFO L225 Difference]: With dead ends: 171 [2022-10-15 16:46:14,536 INFO L226 Difference]: Without dead ends: 171 [2022-10-15 16:46:14,537 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:46:14,537 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:14,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 324 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-10-15 16:46:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-10-15 16:46:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.391304347826087) internal successors, (192), 167 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2022-10-15 16:46:14,544 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 32 [2022-10-15 16:46:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:14,545 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2022-10-15 16:46:14,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-10-15 16:46:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:14,546 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:14,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:14,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:46:14,546 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1407807691, now seen corresponding path program 1 times [2022-10-15 16:46:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:14,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751353142] [2022-10-15 16:46:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:14,644 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:46:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:14,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751353142] [2022-10-15 16:46:14,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751353142] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:14,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:14,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968282613] [2022-10-15 16:46:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:14,647 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:14,747 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2022-10-15 16:46:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:14,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:14,749 INFO L225 Difference]: With dead ends: 169 [2022-10-15 16:46:14,749 INFO L226 Difference]: Without dead ends: 169 [2022-10-15 16:46:14,750 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:46:14,751 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:14,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-15 16:46:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-15 16:46:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 165 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2022-10-15 16:46:14,757 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 32 [2022-10-15 16:46:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:14,757 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2022-10-15 16:46:14,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2022-10-15 16:46:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:46:14,758 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:14,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 16:46:14,759 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1407807690, now seen corresponding path program 1 times [2022-10-15 16:46:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919667070] [2022-10-15 16:46:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:14,920 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:46:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919667070] [2022-10-15 16:46:14,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919667070] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:14,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:14,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033566904] [2022-10-15 16:46:14,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:14,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:14,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:14,923 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:15,010 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2022-10-15 16:46:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:46:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:15,012 INFO L225 Difference]: With dead ends: 167 [2022-10-15 16:46:15,012 INFO L226 Difference]: Without dead ends: 167 [2022-10-15 16:46:15,013 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:46:15,013 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:15,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 318 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-15 16:46:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-10-15 16:46:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 163 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2022-10-15 16:46:15,020 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 32 [2022-10-15 16:46:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:15,020 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2022-10-15 16:46:15,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2022-10-15 16:46:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 16:46:15,021 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:15,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:15,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 16:46:15,022 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -189020998, now seen corresponding path program 1 times [2022-10-15 16:46:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258237876] [2022-10-15 16:46:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:15,118 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:46:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258237876] [2022-10-15 16:46:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258237876] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:15,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302719876] [2022-10-15 16:46:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:15,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:15,121 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:15,223 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2022-10-15 16:46:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-15 16:46:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:15,225 INFO L225 Difference]: With dead ends: 165 [2022-10-15 16:46:15,225 INFO L226 Difference]: Without dead ends: 165 [2022-10-15 16:46:15,226 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:46:15,226 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:15,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-10-15 16:46:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-10-15 16:46:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 161 states have internal predecessors, (186), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2022-10-15 16:46:15,233 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 35 [2022-10-15 16:46:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:15,234 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2022-10-15 16:46:15,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-10-15 16:46:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 16:46:15,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:15,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:15,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 16:46:15,235 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash -189020997, now seen corresponding path program 1 times [2022-10-15 16:46:15,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:15,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203148820] [2022-10-15 16:46:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:15,426 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:46:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:15,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203148820] [2022-10-15 16:46:15,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203148820] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:15,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:15,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893412629] [2022-10-15 16:46:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:15,429 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:15,522 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2022-10-15 16:46:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-15 16:46:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:15,526 INFO L225 Difference]: With dead ends: 163 [2022-10-15 16:46:15,526 INFO L226 Difference]: Without dead ends: 163 [2022-10-15 16:46:15,526 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:46:15,527 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:15,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 312 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-15 16:46:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-10-15 16:46:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 159 states have internal predecessors, (184), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2022-10-15 16:46:15,534 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 35 [2022-10-15 16:46:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:15,535 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2022-10-15 16:46:15,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2022-10-15 16:46:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:46:15,536 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:15,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:15,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 16:46:15,536 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1014349339, now seen corresponding path program 1 times [2022-10-15 16:46:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:15,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319382357] [2022-10-15 16:46:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:15,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:46:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:15,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:46:15,676 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:46:15,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2022-10-15 16:46:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2022-10-15 16:46:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2022-10-15 16:46:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2022-10-15 16:46:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2022-10-15 16:46:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2022-10-15 16:46:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2022-10-15 16:46:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2022-10-15 16:46:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2022-10-15 16:46:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2022-10-15 16:46:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2022-10-15 16:46:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2022-10-15 16:46:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2022-10-15 16:46:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2022-10-15 16:46:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2022-10-15 16:46:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2022-10-15 16:46:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2022-10-15 16:46:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2022-10-15 16:46:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2022-10-15 16:46:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2022-10-15 16:46:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2022-10-15 16:46:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2022-10-15 16:46:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2022-10-15 16:46:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2022-10-15 16:46:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2022-10-15 16:46:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2022-10-15 16:46:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2022-10-15 16:46:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2022-10-15 16:46:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2022-10-15 16:46:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2022-10-15 16:46:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2022-10-15 16:46:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2022-10-15 16:46:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2022-10-15 16:46:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2022-10-15 16:46:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2022-10-15 16:46:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2022-10-15 16:46:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2022-10-15 16:46:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2022-10-15 16:46:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 66 remaining) [2022-10-15 16:46:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 66 remaining) [2022-10-15 16:46:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 66 remaining) [2022-10-15 16:46:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 66 remaining) [2022-10-15 16:46:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2022-10-15 16:46:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2022-10-15 16:46:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2022-10-15 16:46:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2022-10-15 16:46:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2022-10-15 16:46:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2022-10-15 16:46:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2022-10-15 16:46:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2022-10-15 16:46:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2022-10-15 16:46:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2022-10-15 16:46:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2022-10-15 16:46:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2022-10-15 16:46:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2022-10-15 16:46:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2022-10-15 16:46:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2022-10-15 16:46:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (8 of 66 remaining) [2022-10-15 16:46:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2022-10-15 16:46:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2022-10-15 16:46:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2022-10-15 16:46:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2022-10-15 16:46:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2022-10-15 16:46:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2022-10-15 16:46:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2022-10-15 16:46:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2022-10-15 16:46:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 16:46:15,703 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:15,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:46:15,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:46:15 BoogieIcfgContainer [2022-10-15 16:46:15,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:46:15,767 INFO L158 Benchmark]: Toolchain (without parser) took 8485.79ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 130.8MB in the beginning and 177.3MB in the end (delta: -46.4MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,767 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:46:15,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.40ms. Allocated memory is still 157.3MB. Free memory was 130.6MB in the beginning and 117.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.39ms. Allocated memory is still 157.3MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,768 INFO L158 Benchmark]: Boogie Preprocessor took 53.70ms. Allocated memory is still 157.3MB. Free memory was 114.8MB in the beginning and 112.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,769 INFO L158 Benchmark]: RCFGBuilder took 1140.13ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 115.7MB in the end (delta: -3.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,769 INFO L158 Benchmark]: TraceAbstraction took 6635.71ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 115.1MB in the beginning and 177.3MB in the end (delta: -62.1MB). Peak memory consumption was 23.3MB. Max. memory is 8.0GB. [2022-10-15 16:46:15,771 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.31ms. Allocated memory is still 157.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.40ms. Allocated memory is still 157.3MB. Free memory was 130.6MB in the beginning and 117.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.39ms. Allocated memory is still 157.3MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.70ms. Allocated memory is still 157.3MB. Free memory was 114.8MB in the beginning and 112.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1140.13ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 115.7MB in the end (delta: -3.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6635.71ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 115.1MB in the beginning and 177.3MB in the end (delta: -62.1MB). Peak memory consumption was 23.3MB. 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: 237]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 120, overapproximation of bitwiseAnd at line 220, overapproximation of memtrack at line 237. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float x = -1.0f / 0.0f; [L232] float y = __VERIFIER_nondet_float(); [L234] CALL, EXPR __ieee754_hypotf(x, y) [L84] float a = x, b = y, t1, t2, y1, y2, w; [L85] __int32_t j, k, ha, hb; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L88] ieee_float_shape_type gf_u; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={6:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L89] gf_u.value = (x) VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={6:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L90] EXPR gf_u.word VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={6:0}, gf_u.word=8589934590, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L90] (ha) = gf_u.word [L92] ha &= 0x7fffffffL VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L94] ieee_float_shape_type gf_u; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={7:0}, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L95] gf_u.value = (y) VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={7:0}, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L96] EXPR gf_u.word VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, gf_u={7:0}, gf_u.word=8589934589, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L96] (hb) = gf_u.word [L98] hb &= 0x7fffffffL VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934610, b=8589934611, ha=-251658240, hb=1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L99] COND TRUE hb > ha [L100] a = y [L101] b = x [L102] j = ha [L103] ha = hb [L104] hb = j VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934611, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L110] ieee_float_shape_type sf_u; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934611, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={8:0}, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L111] sf_u.word = (ha) VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934611, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={8:0}, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L112] EXPR sf_u.value VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934611, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={8:0}, sf_u.value=8589934614, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L112] (a) = sf_u.value [L115] ieee_float_shape_type sf_u; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934614, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L116] sf_u.word = (hb) VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934614, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L117] EXPR sf_u.value VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934614, b=8589934610, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, sf_u.value=8589934612, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L117] (b) = sf_u.value [L119] COND TRUE (ha - hb) > 0xf000000L [L120] return a + b; VAL [\old(x)=8589934610, \old(y)=8589934611, a=8589934614, b=8589934612, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] [L234] RET, EXPR __ieee754_hypotf(x, y) [L234] float res = __ieee754_hypotf(x, y); [L236] CALL, EXPR isinf_float(res) [L214] __int32_t ix; VAL [\old(x)=8589934613, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934613] [L216] ieee_float_shape_type gf_u; VAL [\old(x)=8589934613, gf_u={5:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934613] [L217] gf_u.value = (x) VAL [\old(x)=8589934613, gf_u={5:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934613] [L218] EXPR gf_u.word VAL [\old(x)=8589934613, gf_u={5:0}, gf_u.word=4294967295, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934613] [L218] (ix) = gf_u.word [L220] ix &= 0x7fffffff [L221] return ((ix) == 0x7f800000L); VAL [\old(x)=8589934613, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934613] [L236] RET, EXPR isinf_float(res) [L236] COND TRUE !isinf_float(res) [L237] reach_error() VAL [one_sqrt=1, res=8589934613, tiny_sqrt=1/1000000000000000000000000000000, x=8589934610, y=8589934611] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 224]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 209 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 7350 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2838 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1762 IncrementalHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 4512 mSDtfsCounter, 1762 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=0, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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:46:15,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...