/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:10:56,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:10:56,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:10:56,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:10:56,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:10:56,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:10:56,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:10:56,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:10:56,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:10:56,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:10:56,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:10:56,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:10:56,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:10:56,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:10:56,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:10:56,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:10:56,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:10:56,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:10:56,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:10:56,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:10:56,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:10:56,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:10:56,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:10:56,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:10:56,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:10:56,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:10:56,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:10:56,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:10:56,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:10:56,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:10:56,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:10:56,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:10:56,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:10:56,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:10:56,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:10:56,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:10:56,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:10:56,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:10:56,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:10:56,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:10:56,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:10:56,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:10:56,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:10:56,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:10:56,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:10:56,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:10:56,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:10:56,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:10:56,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:10:56,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:10:56,599 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:10:56,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:10:56,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:10:56,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:10:56,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:10:56,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:10:56,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:10:56,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:10:56,602 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:10:56,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:10:56,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:10:56,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:10:56,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:10:56,832 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:10:56,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2022-01-10 06:10:56,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7910842/27c532a495d7472d93f034db4e402107/FLAG8b3299035 [2022-01-10 06:10:57,304 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:10:57,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2022-01-10 06:10:57,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7910842/27c532a495d7472d93f034db4e402107/FLAG8b3299035 [2022-01-10 06:10:57,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7910842/27c532a495d7472d93f034db4e402107 [2022-01-10 06:10:57,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:10:57,335 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:10:57,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:10:57,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:10:57,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:10:57,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4382fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57, skipping insertion in model container [2022-01-10 06:10:57,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:10:57,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:10:57,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-01-10 06:10:57,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:10:57,712 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:10:57,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-01-10 06:10:57,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:10:57,772 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:10:57,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57 WrapperNode [2022-01-10 06:10:57,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:10:57,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:10:57,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:10:57,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:10:57,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,827 INFO L137 Inliner]: procedures = 126, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-01-10 06:10:57,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:10:57,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:10:57,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:10:57,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:10:57,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:10:57,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:10:57,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:10:57,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:10:57,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (1/1) ... [2022-01-10 06:10:57,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:10:57,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:10:57,905 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-01-10 06:10:57,907 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-01-10 06:10:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:10:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:10:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:10:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:10:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:10:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:10:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:10:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:10:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:10:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:10:58,059 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:10:58,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:10:58,355 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:10:58,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:10:58,359 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 06:10:58,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:10:58 BoogieIcfgContainer [2022-01-10 06:10:58,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:10:58,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:10:58,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:10:58,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:10:58,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:10:57" (1/3) ... [2022-01-10 06:10:58,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5e6281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:10:58, skipping insertion in model container [2022-01-10 06:10:58,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:10:57" (2/3) ... [2022-01-10 06:10:58,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5e6281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:10:58, skipping insertion in model container [2022-01-10 06:10:58,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:10:58" (3/3) ... [2022-01-10 06:10:58,368 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2022-01-10 06:10:58,372 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:10:58,372 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:10:58,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:10:58,430 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:10:58,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:10:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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-01-10 06:10:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 06:10:58,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:58,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:58,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2022-01-10 06:10:58,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535098059] [2022-01-10 06:10:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:58,462 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:58,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:10:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:58,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:10:58,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:58,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:10:58,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535098059] [2022-01-10 06:10:58,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535098059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:10:58,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:10:58,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:10:58,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493920437] [2022-01-10 06:10:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:10:58,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:10:58,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:10:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:10:58,601 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:58,615 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-01-10 06:10:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:10:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 06:10:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:58,622 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:10:58,622 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 06:10:58,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:10:58,627 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:58,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:10:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 06:10:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 06:10:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-01-10 06:10:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-01-10 06:10:58,647 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2022-01-10 06:10:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:58,648 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-01-10 06:10:58,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-01-10 06:10:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 06:10:58,649 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:58,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:58,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:10:58,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:58,856 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2022-01-10 06:10:58,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:58,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822081214] [2022-01-10 06:10:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:58,857 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:58,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:58,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:58,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:10:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:58,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:10:58,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:58,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:10:58,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822081214] [2022-01-10 06:10:58,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822081214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:10:58,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:10:58,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:10:58,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281212136] [2022-01-10 06:10:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:10:58,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:10:58,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:10:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:10:58,976 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:59,006 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2022-01-10 06:10:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:10:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 06:10:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:59,016 INFO L225 Difference]: With dead ends: 46 [2022-01-10 06:10:59,016 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 06:10:59,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-01-10 06:10:59,018 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:59,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:10:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 06:10:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-01-10 06:10:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-01-10 06:10:59,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2022-01-10 06:10:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:59,022 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-01-10 06:10:59,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-01-10 06:10:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:10:59,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:59,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:59,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:59,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:59,232 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2022-01-10 06:10:59,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:59,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697999524] [2022-01-10 06:10:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:59,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:59,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:59,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:10:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:59,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:10:59,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:59,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:10:59,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:59,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697999524] [2022-01-10 06:10:59,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697999524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:10:59,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:10:59,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:10:59,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469144973] [2022-01-10 06:10:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:10:59,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:10:59,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:10:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:10:59,444 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:59,531 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-01-10 06:10:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:10:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:10:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:59,532 INFO L225 Difference]: With dead ends: 53 [2022-01-10 06:10:59,532 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 06:10:59,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-01-10 06:10:59,533 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:59,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:10:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 06:10:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-10 06:10:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-01-10 06:10:59,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2022-01-10 06:10:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:59,538 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-01-10 06:10:59,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-01-10 06:10:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:10:59,538 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:59,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:59,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:59,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:59,746 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2022-01-10 06:10:59,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:59,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817549024] [2022-01-10 06:10:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:59,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:59,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:59,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:10:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:59,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:10:59,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:59,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:59,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:59,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817549024] [2022-01-10 06:10:59,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817549024] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:59,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:59,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:10:59,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548727563] [2022-01-10 06:10:59,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:59,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:10:59,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:10:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:10:59,961 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:00,041 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2022-01-10 06:11:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:11:00,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:11:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:00,047 INFO L225 Difference]: With dead ends: 61 [2022-01-10 06:11:00,047 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 06:11:00,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:11:00,048 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:00,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 114 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:11:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 06:11:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 06:11:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-01-10 06:11:00,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 19 [2022-01-10 06:11:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:00,054 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-01-10 06:11:00,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-01-10 06:11:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:11:00,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:00,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:00,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:00,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:00,266 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:00,267 INFO L85 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 1 times [2022-01-10 06:11:00,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:00,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610600082] [2022-01-10 06:11:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:00,268 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:00,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:00,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:11:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:00,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:11:00,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:00,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:00,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610600082] [2022-01-10 06:11:00,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610600082] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:00,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:00,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:11:00,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329658031] [2022-01-10 06:11:00,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:00,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:11:00,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:11:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:11:00,885 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:01,093 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2022-01-10 06:11:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:11:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-10 06:11:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:01,096 INFO L225 Difference]: With dead ends: 74 [2022-01-10 06:11:01,096 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 06:11:01,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:11:01,097 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:01,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 284 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:11:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 06:11:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-10 06:11:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 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-01-10 06:11:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-01-10 06:11:01,107 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 40 [2022-01-10 06:11:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:01,108 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-01-10 06:11:01,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-01-10 06:11:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:11:01,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:01,111 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:01,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:11:01,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:01,326 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2036506556, now seen corresponding path program 2 times [2022-01-10 06:11:01,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130850204] [2022-01-10 06:11:01,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:11:01,327 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:01,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:01,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:11:01,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:11:01,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:11:01,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 06:11:01,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:02,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:02,060 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:02,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:02,103 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-10 06:11:02,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:11:02,241 INFO L353 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-01-10 06:11:02,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-01-10 06:11:02,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:11:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 06:11:02,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:02,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_366 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-01-10 06:11:02,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_366 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_365 (_ BitVec 32)) (v_ArrVal_364 (_ BitVec 32)) (v_ArrVal_363 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv24 64)) v_ArrVal_365) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv4 64)) v_ArrVal_364) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_363)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-01-10 06:11:02,761 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:02,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-01-10 06:11:02,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-10 06:11:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2022-01-10 06:11:02,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:02,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130850204] [2022-01-10 06:11:02,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130850204] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:02,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:02,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2022-01-10 06:11:02,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592215181] [2022-01-10 06:11:02,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:02,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 06:11:02,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 06:11:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=91, Unknown=2, NotChecked=38, Total=156 [2022-01-10 06:11:02,836 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:03,900 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-01-10 06:11:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:11:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-10 06:11:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:03,902 INFO L225 Difference]: With dead ends: 90 [2022-01-10 06:11:03,902 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 06:11:03,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=310, Unknown=2, NotChecked=78, Total=506 [2022-01-10 06:11:03,903 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 213 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:03,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 104 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 151 Invalid, 0 Unknown, 114 Unchecked, 0.7s Time] [2022-01-10 06:11:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 06:11:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-01-10 06:11:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 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-01-10 06:11:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2022-01-10 06:11:03,922 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 47 [2022-01-10 06:11:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:03,922 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-01-10 06:11:03,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2022-01-10 06:11:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:11:03,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:03,923 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:03,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:04,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:04,124 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2022-01-10 06:11:04,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109418950] [2022-01-10 06:11:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:04,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:04,129 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:04,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:11:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 06:11:04,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:04,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:04,781 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:04,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:04,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:11:04,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:04,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-01-10 06:11:04,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 06:11:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 06:11:05,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:05,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv12 64))) (_ bv0 32))) is different from false [2022-01-10 06:11:05,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_ArrVal_535 (_ BitVec 32)) (v_ArrVal_540 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv24 64)) v_ArrVal_537) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv4 64)) v_ArrVal_536) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_535)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv12 64))))) is different from false [2022-01-10 06:11:05,588 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:05,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-01-10 06:11:05,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-01-10 06:11:05,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:11:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2022-01-10 06:11:05,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109418950] [2022-01-10 06:11:05,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109418950] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:05,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:05,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-01-10 06:11:05,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911985837] [2022-01-10 06:11:05,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:05,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:11:05,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:11:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=234, Unknown=2, NotChecked=62, Total=342 [2022-01-10 06:11:05,672 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:08,267 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2022-01-10 06:11:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 06:11:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-10 06:11:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:08,269 INFO L225 Difference]: With dead ends: 87 [2022-01-10 06:11:08,269 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 06:11:08,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=628, Unknown=2, NotChecked=110, Total=930 [2022-01-10 06:11:08,270 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 286 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:08,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 155 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 276 Invalid, 0 Unknown, 113 Unchecked, 1.8s Time] [2022-01-10 06:11:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 06:11:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2022-01-10 06:11:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-01-10 06:11:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-01-10 06:11:08,277 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2022-01-10 06:11:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:08,277 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-01-10 06:11:08,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-01-10 06:11:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:11:08,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:08,278 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:08,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:08,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:08,492 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2022-01-10 06:11:08,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:08,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317900241] [2022-01-10 06:11:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:08,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:08,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:08,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:08,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:11:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:11:09,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:11:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:11:09,780 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:11:09,780 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:11:09,781 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:11:09,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 06:11:09,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:09,987 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:09,989 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:11:10,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:11:10 BoogieIcfgContainer [2022-01-10 06:11:10,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:11:10,044 INFO L158 Benchmark]: Toolchain (without parser) took 12710.09ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 128.7MB in the beginning and 106.8MB in the end (delta: 21.9MB). Peak memory consumption was 59.2MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,045 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:11:10,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.34ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 128.5MB in the beginning and 187.0MB in the end (delta: -58.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.99ms. Allocated memory is still 217.1MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,045 INFO L158 Benchmark]: Boogie Preprocessor took 37.76ms. Allocated memory is still 217.1MB. Free memory was 184.9MB in the beginning and 182.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,046 INFO L158 Benchmark]: RCFGBuilder took 494.09ms. Allocated memory is still 217.1MB. Free memory was 182.8MB in the beginning and 168.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,046 INFO L158 Benchmark]: TraceAbstraction took 11682.08ms. Allocated memory is still 217.1MB. Free memory was 167.6MB in the beginning and 106.8MB in the end (delta: 60.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-01-10 06:11:10,047 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.12ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.34ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 128.5MB in the beginning and 187.0MB in the end (delta: -58.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.99ms. Allocated memory is still 217.1MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.76ms. Allocated memory is still 217.1MB. Free memory was 184.9MB in the beginning and 182.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 494.09ms. Allocated memory is still 217.1MB. Free memory was 182.8MB in the beginning and 168.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11682.08ms. Allocated memory is still 217.1MB. Free memory was 167.6MB in the beginning and 106.8MB in the end (delta: 60.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-9223372036854775806:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-9223372036854775806:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-9223372036854775806:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-9223372036854775806:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-9223372036854775806:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-9223372036854775806:0}, len=4, new_head={-9223372036854775806:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-9223372036854775806:0}, len=4, new_head={7:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-9223372036854775806:0}, len=4, new_head={7:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-9223372036854775806:0}, len=4, new_head={7:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-9223372036854775806:0}, len=4, new_head={7:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-9223372036854775806:0}, len=4, new_head={7:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={7:0}, len=3, new_head={7:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={7:0}, len=3, new_head={3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={7:0}, len=3, new_head={3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={7:0}, len=3, new_head={3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={7:0}, len=3, new_head={3:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={7:0}, len=3, new_head={3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={3:0}, len=2, new_head={3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={3:0}, len=2, new_head={6:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={3:0}, len=2, new_head={6:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={3:0}, len=2, new_head={6:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={3:0}, len=2, new_head={6:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={3:0}, len=2, new_head={6:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={6:0}, len=1, new_head={6:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={6:0}, len=1, new_head={10:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={6:0}, len=1, new_head={10:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={6:0}, len=1, new_head={10:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={6:0}, len=1, new_head={10:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={6:0}, len=1, new_head={10:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={10:0}, len=0, new_head={10:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={10:0}, len=0, new_head={10:0}] [L596] return head; VAL [\old(len)=5, \result={10:0}, head={10:0}, len=0, new_head={10:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={10:0}, head->next={6:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={10:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={10:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={10:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 620 mSDsluCounter, 810 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 591 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 219 mSDtfsCounter, 602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 297 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 338 ConstructedInterpolants, 6 QuantifiedInterpolants, 1219 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 273/395 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 06:11:10,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...