/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:29:17,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:29:17,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:29:17,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:29:17,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:29:17,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:29:17,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:29:17,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:29:17,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:29:17,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:29:17,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:29:17,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:29:17,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:29:17,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:29:17,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:29:17,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:29:17,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:29:17,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:29:17,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:29:17,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:29:17,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:29:17,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:29:17,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:29:17,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:29:17,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:29:17,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:29:17,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:29:17,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:29:17,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:29:17,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:29:17,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:29:17,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:29:17,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:29:17,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:29:17,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:29:17,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:29:17,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:29:17,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:29:17,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:29:17,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:29:17,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:29:17,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:29:17,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:29:17,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:29:17,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:29:17,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:29:17,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:29:17,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:29:17,612 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:29:17,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:29:17,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:29:17,613 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:29:17,614 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:29:17,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:29:17,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:29:17,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:29:17,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:29:17,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:29:17,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:29:17,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:29:17,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:29:17,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:29:17,616 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:29:17,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:29:17,617 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:29:17,617 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:29:17,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:29:17,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:29:17,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:29:17,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:29:17,845 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:29:17,846 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-11 05:29:17,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c98ce9c2/38c6ff2f29254ed5b88c125bd0a30346/FLAGee33a6990 [2022-01-11 05:29:18,244 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:29:18,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2022-01-11 05:29:18,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c98ce9c2/38c6ff2f29254ed5b88c125bd0a30346/FLAGee33a6990 [2022-01-11 05:29:18,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c98ce9c2/38c6ff2f29254ed5b88c125bd0a30346 [2022-01-11 05:29:18,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:29:18,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:29:18,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:29:18,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:29:18,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:29:18,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f8131f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18, skipping insertion in model container [2022-01-11 05:29:18,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:29:18,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:29:18,580 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-11 05:29:18,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:29:18,594 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:29:18,627 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-11 05:29:18,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:29:18,648 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:29:18,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18 WrapperNode [2022-01-11 05:29:18,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:29:18,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:29:18,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:29:18,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:29:18,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,700 INFO L137 Inliner]: procedures = 126, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-01-11 05:29:18,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:29:18,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:29:18,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:29:18,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:29:18,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:29:18,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:29:18,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:29:18,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:29:18,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (1/1) ... [2022-01-11 05:29:18,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:29:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:18,810 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-11 05:29:18,829 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-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:29:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:29:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:29:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:29:18,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:29:18,934 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:29:18,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:29:19,142 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:29:19,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:29:19,146 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-11 05:29:19,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:19 BoogieIcfgContainer [2022-01-11 05:29:19,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:29:19,148 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:29:19,148 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:29:19,150 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:29:19,152 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:19" (1/1) ... [2022-01-11 05:29:19,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:29:19 BasicIcfg [2022-01-11 05:29:19,246 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:29:19,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:29:19,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:29:19,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:29:19,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:29:18" (1/4) ... [2022-01-11 05:29:19,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2575c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:29:19, skipping insertion in model container [2022-01-11 05:29:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:18" (2/4) ... [2022-01-11 05:29:19,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2575c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:29:19, skipping insertion in model container [2022-01-11 05:29:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:19" (3/4) ... [2022-01-11 05:29:19,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2575c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:29:19, skipping insertion in model container [2022-01-11 05:29:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:29:19" (4/4) ... [2022-01-11 05:29:19,251 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.iTransformedIcfg [2022-01-11 05:29:19,256 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:29:19,257 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:29:19,302 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:29:19,309 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-11 05:29:19,309 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:29:19,317 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-11 05:29:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:29:19,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:19,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:19,321 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2107866827, now seen corresponding path program 1 times [2022-01-11 05:29:19,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380147337] [2022-01-11 05:29:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:19,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:19,462 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-11 05:29:19,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380147337] [2022-01-11 05:29:19,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380147337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:19,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:19,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:29:19,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214336311] [2022-01-11 05:29:19,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:19,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:29:19,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:29:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:29:19,493 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-11 05:29:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:19,506 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-01-11 05:29:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:29:19,507 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-11 05:29:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:19,512 INFO L225 Difference]: With dead ends: 48 [2022-01-11 05:29:19,512 INFO L226 Difference]: Without dead ends: 24 [2022-01-11 05:29:19,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 05:29:19,518 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-11 05:29:19,519 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-11 05:29:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-11 05:29:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-11 05:29:19,540 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-11 05:29:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-01-11 05:29:19,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2022-01-11 05:29:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:19,543 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-01-11 05:29:19,543 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-11 05:29:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-01-11 05:29:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:29:19,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:19,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:19,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:29:19,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1357738571, now seen corresponding path program 1 times [2022-01-11 05:29:19,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:19,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956133739] [2022-01-11 05:29:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:19,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:19,639 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-11 05:29:19,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:19,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956133739] [2022-01-11 05:29:19,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956133739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:19,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:19,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:29:19,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386909337] [2022-01-11 05:29:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:19,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:29:19,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:19,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:29:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:29:19,643 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11 05:29:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:19,676 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-01-11 05:29:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:29:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11 05:29:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:19,678 INFO L225 Difference]: With dead ends: 41 [2022-01-11 05:29:19,678 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:29:19,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:29:19,683 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:19,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:29:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:29:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-01-11 05:29:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-01-11 05:29:19,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 12 [2022-01-11 05:29:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:19,693 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-01-11 05:29:19,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11 05:29:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-01-11 05:29:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:29:19,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:19,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:19,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:29:19,702 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1357739532, now seen corresponding path program 1 times [2022-01-11 05:29:19,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:19,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788845908] [2022-01-11 05:29:19,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:19,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:19,761 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-11 05:29:19,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:19,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788845908] [2022-01-11 05:29:19,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788845908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:19,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:19,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:29:19,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114535931] [2022-01-11 05:29:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:19,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:29:19,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:29:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:29:19,764 INFO L87 Difference]: Start difference. First operand 27 states and 36 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-11 05:29:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:19,782 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-01-11 05:29:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:29:19,783 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-11 05:29:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:19,784 INFO L225 Difference]: With dead ends: 52 [2022-01-11 05:29:19,784 INFO L226 Difference]: Without dead ends: 34 [2022-01-11 05:29:19,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 05:29:19,789 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-11 05:29:19,790 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-11 05:29:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-11 05:29:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-01-11 05:29:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-11 05:29:19,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 12 [2022-01-11 05:29:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:19,793 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-11 05:29:19,793 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-11 05:29:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-11 05:29:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:29:19,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:19,794 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-11 05:29:19,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:29:19,794 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1717169903, now seen corresponding path program 1 times [2022-01-11 05:29:19,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:19,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159146689] [2022-01-11 05:29:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:19,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:19,868 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-11 05:29:19,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159146689] [2022-01-11 05:29:19,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159146689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:19,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:19,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:29:19,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698783158] [2022-01-11 05:29:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:19,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:29:19,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:29:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:29:19,870 INFO L87 Difference]: Start difference. First operand 28 states and 37 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-11 05:29:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:19,905 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2022-01-11 05:29:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:29:19,906 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-11 05:29:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:19,906 INFO L225 Difference]: With dead ends: 59 [2022-01-11 05:29:19,906 INFO L226 Difference]: Without dead ends: 34 [2022-01-11 05:29:19,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 05:29:19,907 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:19,907 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.0s Time] [2022-01-11 05:29:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-11 05:29:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-11 05:29:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-11 05:29:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-01-11 05:29:19,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2022-01-11 05:29:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:19,910 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-01-11 05:29:19,911 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-11 05:29:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-01-11 05:29:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:29:19,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:19,911 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-11 05:29:19,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:29:19,911 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1846252622, now seen corresponding path program 1 times [2022-01-11 05:29:19,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:19,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335551358] [2022-01-11 05:29:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:19,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:20,041 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-11 05:29:20,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:20,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335551358] [2022-01-11 05:29:20,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335551358] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:20,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927020284] [2022-01-11 05:29:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:20,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:20,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:20,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:29:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:20,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-11 05:29:20,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:20,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,216 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 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-11 05:29:20,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:20,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:20,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2022-01-11 05:29:20,471 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-11 05:29:20,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:29:20,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927020284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:20,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:29:20,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2022-01-11 05:29:20,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275037308] [2022-01-11 05:29:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:20,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:29:20,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:29:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:29:20,475 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 05:29:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:20,852 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-01-11 05:29:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:29:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 05:29:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:20,853 INFO L225 Difference]: With dead ends: 53 [2022-01-11 05:29:20,853 INFO L226 Difference]: Without dead ends: 48 [2022-01-11 05:29:20,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-11 05:29:20,854 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 174 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:20,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 65 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:29:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-11 05:29:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-01-11 05:29:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 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-11 05:29:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-01-11 05:29:20,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 19 [2022-01-11 05:29:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:20,859 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-01-11 05:29:20,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 05:29:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-01-11 05:29:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:29:20,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:20,860 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-11 05:29:20,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:21,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:21,072 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1847177104, now seen corresponding path program 1 times [2022-01-11 05:29:21,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329671208] [2022-01-11 05:29:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:21,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:21,186 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-11 05:29:21,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:21,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329671208] [2022-01-11 05:29:21,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329671208] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405772004] [2022-01-11 05:29:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:21,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:21,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:21,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:29:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:21,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:29:21,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:21,425 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-11 05:29:21,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:21,570 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-11 05:29:21,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405772004] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:29:21,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:29:21,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-11 05:29:21,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543476576] [2022-01-11 05:29:21,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:29:21,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:29:21,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:29:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:29:21,572 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:21,660 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-01-11 05:29:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:29:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-11 05:29:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:21,661 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:29:21,661 INFO L226 Difference]: Without dead ends: 52 [2022-01-11 05:29:21,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:29:21,662 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:21,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:29:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-11 05:29:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-01-11 05:29:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-11 05:29:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-01-11 05:29:21,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 19 [2022-01-11 05:29:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:21,668 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-01-11 05:29:21,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-01-11 05:29:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 05:29:21,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:21,669 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-11 05:29:21,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:21,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:29:21,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash -634550153, now seen corresponding path program 1 times [2022-01-11 05:29:21,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586705040] [2022-01-11 05:29:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:21,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:22,084 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-11 05:29:22,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586705040] [2022-01-11 05:29:22,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586705040] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170286638] [2022-01-11 05:29:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:22,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:22,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:22,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:29:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:24,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-11 05:29:24,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:26,290 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-11 05:29:26,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:32,174 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-11 05:29:32,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170286638] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:29:32,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:29:32,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-01-11 05:29:32,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480351363] [2022-01-11 05:29:32,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:29:32,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:29:32,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:32,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:29:32,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:29:32,179 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-11 05:29:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:32,984 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2022-01-11 05:29:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:29:32,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-11 05:29:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:32,985 INFO L225 Difference]: With dead ends: 108 [2022-01-11 05:29:32,985 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 05:29:32,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-01-11 05:29:32,986 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:32,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 287 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-01-11 05:29:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 05:29:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-01-11 05:29:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 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-11 05:29:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2022-01-11 05:29:32,995 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 40 [2022-01-11 05:29:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:32,995 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2022-01-11 05:29:32,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-11 05:29:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-01-11 05:29:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-11 05:29:32,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:32,996 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-11 05:29:33,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:33,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:33,202 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 13773776, now seen corresponding path program 2 times [2022-01-11 05:29:33,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:33,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024648566] [2022-01-11 05:29:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:33,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:29:33,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 05:29:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:29:34,007 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 05:29:34,007 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 05:29:34,008 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 05:29:34,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 05:29:34,011 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:34,013 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 05:29:34,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:29:34 BasicIcfg [2022-01-11 05:29:34,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 05:29:34,086 INFO L158 Benchmark]: Toolchain (without parser) took 15822.87ms. Allocated memory was 183.5MB in the beginning and 307.2MB in the end (delta: 123.7MB). Free memory was 132.1MB in the beginning and 191.2MB in the end (delta: -59.1MB). Peak memory consumption was 155.3MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,086 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory was 150.5MB in the beginning and 150.4MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 05:29:34,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.29ms. Allocated memory is still 183.5MB. Free memory was 131.8MB in the beginning and 150.5MB in the end (delta: -18.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.45ms. Allocated memory is still 183.5MB. Free memory was 150.5MB in the beginning and 148.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,087 INFO L158 Benchmark]: Boogie Preprocessor took 35.86ms. Allocated memory is still 183.5MB. Free memory was 148.3MB in the beginning and 146.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,087 INFO L158 Benchmark]: RCFGBuilder took 410.34ms. Allocated memory is still 183.5MB. Free memory was 146.6MB in the beginning and 133.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,087 INFO L158 Benchmark]: IcfgTransformer took 98.06ms. Allocated memory is still 183.5MB. Free memory was 133.3MB in the beginning and 128.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,087 INFO L158 Benchmark]: TraceAbstraction took 14838.43ms. Allocated memory was 183.5MB in the beginning and 307.2MB in the end (delta: 123.7MB). Free memory was 127.7MB in the beginning and 191.2MB in the end (delta: -63.4MB). Peak memory consumption was 151.0MB. Max. memory is 8.0GB. [2022-01-11 05:29:34,090 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.09ms. Allocated memory is still 183.5MB. Free memory was 150.5MB in the beginning and 150.4MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.29ms. Allocated memory is still 183.5MB. Free memory was 131.8MB in the beginning and 150.5MB in the end (delta: -18.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.45ms. Allocated memory is still 183.5MB. Free memory was 150.5MB in the beginning and 148.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.86ms. Allocated memory is still 183.5MB. Free memory was 148.3MB in the beginning and 146.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 410.34ms. Allocated memory is still 183.5MB. Free memory was 146.6MB in the beginning and 133.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 98.06ms. Allocated memory is still 183.5MB. Free memory was 133.3MB in the beginning and 128.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 14838.43ms. Allocated memory was 183.5MB in the beginning and 307.2MB in the end (delta: 123.7MB). Free memory was 127.7MB in the beginning and 191.2MB in the end (delta: -63.4MB). Peak memory consumption was 151.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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={-6:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-6: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={0:0}, len=5, 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={0:0}, len=5, new_head={-6:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-6:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-6:0}, len=4, 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=4, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-6:0}, len=4, new_head={-5: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={-6:0}, len=4, new_head={-5: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=4, new_head={-5:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-6:0}, len=4, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=3, new_head={-5: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={-5:0}, len=3, new_head={-10:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-5:0}, len=3, 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={-5:0}, len=3, 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={-5:0}, len=3, new_head={-10:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-5:0}, len=3, new_head={-10:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-10:0}, len=2, new_head={-10: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={-10:0}, len=2, new_head={-9:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-10:0}, len=2, new_head={-9: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={-10:0}, len=2, new_head={-9: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={-10:0}, len=2, new_head={-9:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-10:0}, len=2, new_head={-9:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-9:0}, len=1, new_head={-9: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={-9:0}, len=1, new_head={-7:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-9:0}, len=1, new_head={-7: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={-9:0}, len=1, 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={-9:0}, len=1, new_head={-7:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-9:0}, len=1, new_head={-7:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-7:0}, len=0, new_head={-7:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-7:0}, len=0, new_head={-7:0}] [L596] return head; VAL [\old(len)=5, \result={-7:0}, head={-7:0}, len=0, new_head={-7:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-7:0}, head->next={-9: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={-7: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={-7: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={-7:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 358 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 228 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 258 ConstructedInterpolants, 21 QuantifiedInterpolants, 4624 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1319 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 2/144 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-11 05:29:34,107 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...