java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:36,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:36,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:36,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:36,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:36,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:36,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:36,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:36,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:36,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:36,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:36,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:36,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:36,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:36,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:36,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:36,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:36,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:36,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:36,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:36,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:36,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:36,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:36,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:36,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:36,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:36,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:36,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:36,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:36,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:36,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:36,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:36,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:36,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:36,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:36,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:36,364 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:36,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:36,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:36,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:36,380 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:36,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:36,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:36,381 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:36,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:36,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:36,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:36,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:36,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:36,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:36,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:36,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:36,383 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:36,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:36,383 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:36,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:36,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:36,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:36,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:36,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:36,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:36,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:36,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:36,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:36,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:36,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:36,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:36,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:36,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:36,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:36,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:36,444 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:36,445 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:36,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i [2018-11-23 13:00:36,508 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af88f9bd4/0327f578822f42a59b77f9aae16c9a65/FLAG1b7cf7f4f [2018-11-23 13:00:36,978 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:36,978 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i [2018-11-23 13:00:36,998 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af88f9bd4/0327f578822f42a59b77f9aae16c9a65/FLAG1b7cf7f4f [2018-11-23 13:00:37,298 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af88f9bd4/0327f578822f42a59b77f9aae16c9a65 [2018-11-23 13:00:37,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:37,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:37,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:37,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:37,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:37,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:37" (1/1) ... [2018-11-23 13:00:37,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c4e53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:37, skipping insertion in model container [2018-11-23 13:00:37,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:37" (1/1) ... [2018-11-23 13:00:37,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:37,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:37,818 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:37,837 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:37,904 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:38,044 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:38,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38 WrapperNode [2018-11-23 13:00:38,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:38,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:38,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:38,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:38,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:38,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:38,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:38,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:38,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:38,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:38,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:38,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:38,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2018-11-23 13:00:38,226 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2018-11-23 13:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2018-11-23 13:00:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-23 13:00:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-23 13:00:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:00:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2018-11-23 13:00:38,228 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2018-11-23 13:00:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:39,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:39,133 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:00:39,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:39 BoogieIcfgContainer [2018-11-23 13:00:39,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:39,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:39,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:39,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:39,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:37" (1/3) ... [2018-11-23 13:00:39,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760485df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:39, skipping insertion in model container [2018-11-23 13:00:39,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38" (2/3) ... [2018-11-23 13:00:39,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760485df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:39, skipping insertion in model container [2018-11-23 13:00:39,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:39" (3/3) ... [2018-11-23 13:00:39,142 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2018-11-23 13:00:39,152 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:39,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:39,178 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:39,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:39,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:39,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:39,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:39,210 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:39,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:39,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:39,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:39,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 13:00:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:00:39,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:39,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:39,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:39,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash -593941020, now seen corresponding path program 1 times [2018-11-23 13:00:39,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:39,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:39,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:39,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 13:00:39,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44#true} is VALID [2018-11-23 13:00:39,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 13:00:39,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #103#return; {44#true} is VALID [2018-11-23 13:00:39,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret23 := main(); {44#true} is VALID [2018-11-23 13:00:39,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);~next_time~0 := 1; {46#(= main_~next_time~0 1)} is VALID [2018-11-23 13:00:39,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {46#(= main_~next_time~0 1)} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {46#(= main_~next_time~0 1)} is VALID [2018-11-23 13:00:39,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#(= main_~next_time~0 1)} assume !!(0 != #t~nondet12);havoc #t~nondet12;#t~short14 := ~next_time~0 < 1000; {47#|main_#t~short14|} is VALID [2018-11-23 13:00:39,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {47#|main_#t~short14|} assume !#t~short14; {45#false} is VALID [2018-11-23 13:00:39,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#false} assume !#t~short14;havoc #t~nondet13;havoc #t~short14; {45#false} is VALID [2018-11-23 13:00:39,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {45#false} assume !(~next_time~0 > 1); {45#false} is VALID [2018-11-23 13:00:39,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#false} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4); {45#false} is VALID [2018-11-23 13:00:39,495 INFO L256 TraceCheckUtils]: 12: Hoare triple {45#false} call check_queue(#t~mem22.base, #t~mem22.offset); {45#false} is VALID [2018-11-23 13:00:39,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {45#false} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {45#false} is VALID [2018-11-23 13:00:39,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {45#false} assume !!(~n~0.base != 0 || ~n~0.offset != 0);call #t~mem11 := read~int(~n~0.base, 4 + ~n~0.offset, 4); {45#false} is VALID [2018-11-23 13:00:39,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {45#false} assume !(#t~mem11 >= 1);havoc #t~mem11; {45#false} is VALID [2018-11-23 13:00:39,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 13:00:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:39,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:39,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:39,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:00:39,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:39,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:39,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:39,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:39,587 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-11-23 13:00:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:40,532 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2018-11-23 13:00:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:40,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:00:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2018-11-23 13:00:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2018-11-23 13:00:40,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2018-11-23 13:00:40,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:40,869 INFO L225 Difference]: With dead ends: 87 [2018-11-23 13:00:40,869 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:00:40,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:00:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:00:41,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:41,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 13:00:41,114 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:00:41,115 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:00:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,121 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:00:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:00:41,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,123 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:00:41,123 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:00:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,129 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:00:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:00:41,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:41,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:00:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 13:00:41,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 17 [2018-11-23 13:00:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:41,137 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 13:00:41,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:00:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:00:41,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:41,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:41,139 INFO L423 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:41,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1273999390, now seen corresponding path program 1 times [2018-11-23 13:00:41,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:41,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 13:00:41,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {310#true} is VALID [2018-11-23 13:00:41,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 13:00:41,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #103#return; {310#true} is VALID [2018-11-23 13:00:41,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret23 := main(); {310#true} is VALID [2018-11-23 13:00:41,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);~next_time~0 := 1; {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !!(0 != #t~nondet12);havoc #t~nondet12;#t~short14 := ~next_time~0 < 1000; {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume #t~short14;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;#t~short14 := 0 != #t~nondet13; {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !#t~short14;havoc #t~nondet13;havoc #t~short14; {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !(~next_time~0 > 1); {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:41,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {312#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4); {313#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|))} is VALID [2018-11-23 13:00:41,529 INFO L256 TraceCheckUtils]: 12: Hoare triple {313#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|))} call check_queue(#t~mem22.base, #t~mem22.offset); {314#(and (= 0 |check_queue_#in~q.offset|) (= 0 |check_queue_#in~q.base|))} is VALID [2018-11-23 13:00:41,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {314#(and (= 0 |check_queue_#in~q.offset|) (= 0 |check_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {315#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} is VALID [2018-11-23 13:00:41,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {315#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} assume !!(~n~0.base != 0 || ~n~0.offset != 0);call #t~mem11 := read~int(~n~0.base, 4 + ~n~0.offset, 4); {311#false} is VALID [2018-11-23 13:00:41,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {311#false} assume !(#t~mem11 >= 1);havoc #t~mem11; {311#false} is VALID [2018-11-23 13:00:41,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 13:00:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:41,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:41,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:00:41,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:00:41,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:41,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:41,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:41,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:41,570 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 13:00:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,070 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-23 13:00:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:00:42,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:00:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 13:00:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 13:00:42,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2018-11-23 13:00:42,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,295 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:00:42,295 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:00:42,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:00:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 13:00:42,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 13:00:42,331 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:00:42,331 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:00:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,334 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 13:00:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 13:00:42,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,336 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:00:42,336 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:00:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,339 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 13:00:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 13:00:42,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:42,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:00:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 13:00:42,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 17 [2018-11-23 13:00:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:42,345 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 13:00:42,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 13:00:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:00:42,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:42,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:42,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:42,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1557001454, now seen corresponding path program 1 times [2018-11-23 13:00:42,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:42,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:42,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:42,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-23 13:00:42,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {597#true} is VALID [2018-11-23 13:00:42,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-23 13:00:42,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #103#return; {597#true} is VALID [2018-11-23 13:00:42,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret23 := main(); {597#true} is VALID [2018-11-23 13:00:42,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {597#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);~next_time~0 := 1; {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} is VALID [2018-11-23 13:00:42,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} is VALID [2018-11-23 13:00:42,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} assume !!(0 != #t~nondet12);havoc #t~nondet12;#t~short14 := ~next_time~0 < 1000; {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} is VALID [2018-11-23 13:00:42,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} assume #t~short14;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;#t~short14 := 0 != #t~nondet13; {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} is VALID [2018-11-23 13:00:42,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {599#(and (= 1 main_~next_time~0) (= (select |#valid| |main_~#queue~0.base|) 1))} assume #t~short14;havoc #t~nondet13;havoc #t~short14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~new_id~0 := #t~nondet15;havoc #t~nondet15;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.alloc(12);~new_process~0.base, ~new_process~0.offset := #t~malloc16.base, #t~malloc16.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, ~new_process~0.base, ~new_process~0.offset, 4);havoc #t~nondet17;#t~post18 := ~next_time~0;~next_time~0 := 1 + #t~post18;call write~int(#t~post18, ~new_process~0.base, 4 + ~new_process~0.offset, 4);havoc #t~post18; {600#(and (<= 0 main_~new_process~0.offset) (<= main_~new_process~0.offset 0) (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (not (= |main_~#queue~0.base| main_~new_process~0.base)))} is VALID [2018-11-23 13:00:42,995 INFO L256 TraceCheckUtils]: 10: Hoare triple {600#(and (<= 0 main_~new_process~0.offset) (<= main_~new_process~0.offset 0) (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (not (= |main_~#queue~0.base| main_~new_process~0.base)))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {601#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:00:43,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {601#(= |#memory_int| |old(#memory_int)|)} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, 8 + ~n.offset, 4);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4); {602#(and (= (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.offset|) (or (= |append_to_queue_#in~n.base| |append_to_queue_#in~q.base|) (and (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (store (select |old(#memory_int)| |append_to_queue_#in~n.base|) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))))) (or (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (select |old(#memory_int)| |append_to_queue_#in~n.base|)) (<= (+ |append_to_queue_#in~n.offset| 8) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))))))))} is VALID [2018-11-23 13:00:43,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.offset|) (or (= |append_to_queue_#in~n.base| |append_to_queue_#in~q.base|) (and (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (store (select |old(#memory_int)| |append_to_queue_#in~n.base|) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))))) (or (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (select |old(#memory_int)| |append_to_queue_#in~n.base|)) (<= (+ |append_to_queue_#in~n.offset| 8) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))))))))} assume true; {602#(and (= (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.offset|) (or (= |append_to_queue_#in~n.base| |append_to_queue_#in~q.base|) (and (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (store (select |old(#memory_int)| |append_to_queue_#in~n.base|) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))))) (or (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (select |old(#memory_int)| |append_to_queue_#in~n.base|)) (<= (+ |append_to_queue_#in~n.offset| 8) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))))))))} is VALID [2018-11-23 13:00:43,010 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {602#(and (= (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.offset|) (or (= |append_to_queue_#in~n.base| |append_to_queue_#in~q.base|) (and (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (store (select |old(#memory_int)| |append_to_queue_#in~n.base|) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))))) (or (= (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (select |old(#memory_int)| |append_to_queue_#in~n.base|)) (<= (+ |append_to_queue_#in~n.offset| 8) (@diff (select |old(#memory_int)| |append_to_queue_#in~n.base|) (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))))))))} {600#(and (<= 0 main_~new_process~0.offset) (<= main_~new_process~0.offset 0) (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (not (= |main_~#queue~0.base| main_~new_process~0.base)))} #97#return; {603#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) 4)) (<= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-23 13:00:43,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {603#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) 4)) (<= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4); {604#(and (<= 0 |main_#t~mem22.offset|) (= 1 (select (select |#memory_int| |main_#t~mem22.base|) 4)) (<= |main_#t~mem22.offset| 0))} is VALID [2018-11-23 13:00:43,017 INFO L256 TraceCheckUtils]: 15: Hoare triple {604#(and (<= 0 |main_#t~mem22.offset|) (= 1 (select (select |#memory_int| |main_#t~mem22.base|) 4)) (<= |main_#t~mem22.offset| 0))} call check_queue(#t~mem22.base, #t~mem22.offset); {605#(and (<= |check_queue_#in~q.offset| 0) (<= 0 |check_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |check_queue_#in~q.base|) 4)))} is VALID [2018-11-23 13:00:43,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {605#(and (<= |check_queue_#in~q.offset| 0) (<= 0 |check_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |check_queue_#in~q.base|) 4)))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {606#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (<= check_queue_~n~0.offset 0) (< 0 (+ check_queue_~n~0.offset 1)))} is VALID [2018-11-23 13:00:43,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (<= check_queue_~n~0.offset 0) (< 0 (+ check_queue_~n~0.offset 1)))} assume !!(~n~0.base != 0 || ~n~0.offset != 0);call #t~mem11 := read~int(~n~0.base, 4 + ~n~0.offset, 4); {607#(= |check_queue_#t~mem11| 1)} is VALID [2018-11-23 13:00:43,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {607#(= |check_queue_#t~mem11| 1)} assume !(#t~mem11 >= 1);havoc #t~mem11; {598#false} is VALID [2018-11-23 13:00:43,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-23 13:00:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:43,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 13:00:43,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:00:43,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:43,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:00:43,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:43,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:00:43,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:00:43,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:00:43,088 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 11 states. [2018-11-23 13:00:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,393 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-11-23 13:00:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:00:45,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:00:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:00:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2018-11-23 13:00:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:00:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2018-11-23 13:00:45,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 95 transitions. [2018-11-23 13:00:45,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:45,659 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:00:45,659 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:00:45,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:00:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:00:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-11-23 13:00:45,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:45,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 65 states. [2018-11-23 13:00:45,805 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 65 states. [2018-11-23 13:00:45,805 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 65 states. [2018-11-23 13:00:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,811 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-23 13:00:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-23 13:00:45,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:45,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:45,813 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 77 states. [2018-11-23 13:00:45,813 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 77 states. [2018-11-23 13:00:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,819 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-23 13:00:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-23 13:00:45,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:45,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:45,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:45,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:00:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-11-23 13:00:45,825 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 20 [2018-11-23 13:00:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:45,825 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-11-23 13:00:45,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:00:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-11-23 13:00:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:00:45,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:45,827 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:45,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:45,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1020405248, now seen corresponding path program 1 times [2018-11-23 13:00:45,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:45,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:45,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:46,233 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:00:46,237 INFO L168 Benchmark]: Toolchain (without parser) took 8929.20 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -142.4 MB). Peak memory consumption was 564.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:46,239 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:46,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:46,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:46,241 INFO L168 Benchmark]: Boogie Preprocessor took 68.95 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:46,242 INFO L168 Benchmark]: RCFGBuilder took 978.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:46,243 INFO L168 Benchmark]: TraceAbstraction took 7100.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 574.1 MB). Peak memory consumption was 574.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:46,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.95 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 978.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7100.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 574.1 MB). Peak memory consumption was 574.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...