/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bor5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:11:45,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:11:45,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:11:45,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:11:45,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:11:45,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:11:45,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:11:45,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:11:45,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:11:45,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:11:45,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:11:45,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:11:45,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:11:45,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:11:45,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:11:45,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:11:45,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:11:45,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:11:45,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:11:45,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:11:45,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:11:45,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:11:45,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:11:45,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:11:45,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:11:45,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:11:45,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:11:45,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:11:45,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:11:45,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:11:45,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:11:45,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:11:45,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:11:45,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:11:45,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:11:45,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:11:45,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:11:45,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:11:45,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:11:45,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:11:45,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:11:45,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:11:45,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:11:45,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:11:45,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:11:45,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:11:45,579 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:11:45,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:11:45,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:11:45,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:11:45,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:11:45,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:11:45,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:11:45,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:11:45,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:11:45,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:11:45,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:11:45,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:11:45,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:11:45,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:11:45,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:11:45,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:11:45,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:11:45,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:11:45,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:11:45,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:11:45,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:11:45,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:11:45,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:11:45,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:11:45,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:11:45,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:11:45,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:11:45,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:11:45,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:11:45,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:11:45,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:11:45,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor5.i [2019-11-23 20:11:45,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426f70b96/9d5b377457fa4b81902f58317d6db73f/FLAGd9f992500 [2019-11-23 20:11:46,460 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:11:46,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor5.i [2019-11-23 20:11:46,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426f70b96/9d5b377457fa4b81902f58317d6db73f/FLAGd9f992500 [2019-11-23 20:11:46,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426f70b96/9d5b377457fa4b81902f58317d6db73f [2019-11-23 20:11:46,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:11:46,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:11:46,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:11:46,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:11:46,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:11:46,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:46" (1/1) ... [2019-11-23 20:11:46,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4fc72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:46, skipping insertion in model container [2019-11-23 20:11:46,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:46" (1/1) ... [2019-11-23 20:11:46,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:11:46,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:11:47,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:11:47,055 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:11:47,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:11:47,108 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:11:47,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47 WrapperNode [2019-11-23 20:11:47,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:11:47,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:11:47,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:11:47,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:11:47,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:11:47,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:11:47,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:11:47,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:11:47,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (1/1) ... [2019-11-23 20:11:47,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:11:47,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:11:47,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:11:47,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:11:47,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (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 [2019-11-23 20:11:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:11:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:11:47,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:11:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:11:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:11:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:11:47,692 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:11:47,693 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-23 20:11:47,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:47 BoogieIcfgContainer [2019-11-23 20:11:47,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:11:47,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:11:47,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:11:47,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:11:47,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:11:46" (1/3) ... [2019-11-23 20:11:47,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:47, skipping insertion in model container [2019-11-23 20:11:47,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:47" (2/3) ... [2019-11-23 20:11:47,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:47, skipping insertion in model container [2019-11-23 20:11:47,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:47" (3/3) ... [2019-11-23 20:11:47,702 INFO L109 eAbstractionObserver]: Analyzing ICFG bor5.i [2019-11-23 20:11:47,711 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:11:47,717 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:11:47,727 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:11:47,748 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:11:47,748 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:11:47,748 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:11:47,749 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:11:47,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:11:47,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:11:47,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:11:47,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:11:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-23 20:11:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:11:47,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:47,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:47,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1563818866, now seen corresponding path program 1 times [2019-11-23 20:11:47,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:47,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156180228] [2019-11-23 20:11:47,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:11:47,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156180228] [2019-11-23 20:11:47,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:11:47,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:11:47,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479191783] [2019-11-23 20:11:47,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:11:47,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:11:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:11:47,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:11:47,943 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-23 20:11:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:11:47,961 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2019-11-23 20:11:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:11:47,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-23 20:11:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:11:47,971 INFO L225 Difference]: With dead ends: 53 [2019-11-23 20:11:47,971 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 20:11:47,974 INFO L630 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 [2019-11-23 20:11:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 20:11:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-23 20:11:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 20:11:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-23 20:11:48,007 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2019-11-23 20:11:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:11:48,007 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-23 20:11:48,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:11:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-23 20:11:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:11:48,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:48,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:48,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2019195128, now seen corresponding path program 1 times [2019-11-23 20:11:48,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:48,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328751014] [2019-11-23 20:11:48,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:11:48,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328751014] [2019-11-23 20:11:48,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:11:48,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:11:48,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900610840] [2019-11-23 20:11:48,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:11:48,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:11:48,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:11:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:11:48,134 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-11-23 20:11:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:11:48,202 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-11-23 20:11:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:11:48,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 20:11:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:11:48,204 INFO L225 Difference]: With dead ends: 45 [2019-11-23 20:11:48,204 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 20:11:48,205 INFO L630 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 [2019-11-23 20:11:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 20:11:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-23 20:11:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:11:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-23 20:11:48,212 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-23 20:11:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:11:48,212 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-23 20:11:48,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:11:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-23 20:11:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:11:48,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:48,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:48,214 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2143387046, now seen corresponding path program 1 times [2019-11-23 20:11:48,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281806161] [2019-11-23 20:11:48,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:11:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281806161] [2019-11-23 20:11:48,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:11:48,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:11:48,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316762853] [2019-11-23 20:11:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:11:48,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:11:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:11:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:11:48,331 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-11-23 20:11:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:11:48,428 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-11-23 20:11:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:11:48,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-23 20:11:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:11:48,430 INFO L225 Difference]: With dead ends: 47 [2019-11-23 20:11:48,430 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:11:48,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:11:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:11:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-23 20:11:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:11:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-23 20:11:48,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-11-23 20:11:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:11:48,437 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-23 20:11:48,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:11:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-23 20:11:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 20:11:48,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:48,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:48,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash 46775620, now seen corresponding path program 1 times [2019-11-23 20:11:48,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:48,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651299294] [2019-11-23 20:11:48,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:11:48,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651299294] [2019-11-23 20:11:48,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:11:48,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:11:48,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699944461] [2019-11-23 20:11:48,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:11:48,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:11:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:11:48,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:11:48,523 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-11-23 20:11:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:11:48,584 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-23 20:11:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:11:48,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-23 20:11:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:11:48,588 INFO L225 Difference]: With dead ends: 39 [2019-11-23 20:11:48,588 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 20:11:48,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:11:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 20:11:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-23 20:11:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:11:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-23 20:11:48,604 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2019-11-23 20:11:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:11:48,605 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-23 20:11:48,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:11:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-23 20:11:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:11:48,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:48,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:48,607 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash -548779230, now seen corresponding path program 1 times [2019-11-23 20:11:48,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:48,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478438727] [2019-11-23 20:11:48,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:11:48,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478438727] [2019-11-23 20:11:48,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506964085] [2019-11-23 20:11:48,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:11:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:11:48,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:11:48,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:11:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:11:48,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:11:48,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 20:11:48,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288340861] [2019-11-23 20:11:48,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:11:48,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:11:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:11:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:11:48,889 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-11-23 20:11:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:11:48,948 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-23 20:11:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:11:48,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-23 20:11:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:11:48,950 INFO L225 Difference]: With dead ends: 55 [2019-11-23 20:11:48,950 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 20:11:48,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:11:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 20:11:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-23 20:11:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 20:11:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-23 20:11:48,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2019-11-23 20:11:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:11:48,957 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-23 20:11:48,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:11:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-23 20:11:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:11:48,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:11:48,958 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:11:49,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:11:49,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:11:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:11:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1519457344, now seen corresponding path program 2 times [2019-11-23 20:11:49,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:11:49,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584372242] [2019-11-23 20:11:49,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:11:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 20:11:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 20:11:49,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 20:11:49,334 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 20:11:49,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:11:49 BoogieIcfgContainer [2019-11-23 20:11:49,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:11:49,402 INFO L168 Benchmark]: Toolchain (without parser) took 2597.37 ms. Allocated memory was 146.3 MB in the beginning and 234.9 MB in the end (delta: 88.6 MB). Free memory was 104.8 MB in the beginning and 178.1 MB in the end (delta: -73.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,403 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.61 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.81 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,411 INFO L168 Benchmark]: Boogie Preprocessor took 30.33 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 179.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,412 INFO L168 Benchmark]: RCFGBuilder took 425.42 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 161.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,413 INFO L168 Benchmark]: TraceAbstraction took 1702.46 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 161.2 MB in the beginning and 178.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:11:49,423 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.61 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 128.81 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.33 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 179.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 425.42 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 161.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1702.46 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 161.2 MB in the beginning and 178.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 14. Possible FailurePath: [L6] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; [L29] int i = 0; VAL [N=2] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [N=2] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [N=2] [L29] COND FALSE !(i < N) VAL [N=2] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [N=2] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res | x[i] [L13] i++ VAL [N=2] [L13] COND FALSE !(i < N) VAL [N=2] [L16] return res; VAL [N=2] [L34] ret = bor(x) [L36] EXPR x[0] [L36] temp=x[0] [L36] EXPR x[1] [L36] x[0] = x[1] [L36] x[1] = temp [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [N=2] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res | x[i] [L13] i++ VAL [N=2] [L13] COND FALSE !(i < N) VAL [N=2] [L16] return res; VAL [N=2] [L37] ret2 = bor(x) [L38] EXPR x[0] [L38] temp=x[0] [L39] int i =0 ; VAL [N=2] [L39] COND TRUE i