/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:35:32,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:35:32,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:35:32,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:35:32,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:35:32,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:35:32,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:35:32,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:35:32,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:35:32,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:35:32,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:35:32,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:35:32,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:35:32,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:35:32,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:35:32,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:35:32,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:35:32,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:35:32,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:35:32,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:35:32,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:35:32,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:35:32,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:35:32,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:35:32,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:35:32,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:35:32,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:35:32,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:35:32,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:35:32,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:35:32,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:35:32,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:35:32,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:35:32,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:35:32,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:35:32,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:35:32,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:35:32,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:35:32,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:35:32,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:35:32,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:35:32,500 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-06 18:35:32,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:35:32,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:35:32,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:35:32,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:35:32,516 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:35:32,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:35:32,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:35:32,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:35:32,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:35:32,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:35:32,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:35:32,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:35:32,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:35:32,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:35:32,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:35:32,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:35:32,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:35:32,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:35:32,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:35:32,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:35:32,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:35:32,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:35:32,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:35:32,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:35:32,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:35:32,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:35:32,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:35:32,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:35:32,834 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:35:32,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd5.i [2019-11-06 18:35:32,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe59a54a7/18ed82b92a9f4b2f862532a11f072d99/FLAG6ff2bce86 [2019-11-06 18:35:33,370 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:35:33,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i [2019-11-06 18:35:33,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe59a54a7/18ed82b92a9f4b2f862532a11f072d99/FLAG6ff2bce86 [2019-11-06 18:35:33,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe59a54a7/18ed82b92a9f4b2f862532a11f072d99 [2019-11-06 18:35:33,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:35:33,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:35:33,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:35:33,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:35:33,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:35:33,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:35:33" (1/1) ... [2019-11-06 18:35:33,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677ed351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:33, skipping insertion in model container [2019-11-06 18:35:33,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:35:33" (1/1) ... [2019-11-06 18:35:33,832 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:35:33,853 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:35:34,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:35:34,090 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:35:34,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:35:34,143 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:35:34,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34 WrapperNode [2019-11-06 18:35:34,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:35:34,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:35:34,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:35:34,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:35:34,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (1/1) ... [2019-11-06 18:35:34,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:35:34,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:35:34,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:35:34,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:35:34,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (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-06 18:35:34,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:35:34,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:35:34,327 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-11-06 18:35:34,327 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:35:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:35:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:35:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:35:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:35:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:35:34,614 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:35:34,614 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:35:34,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:35:34 BoogieIcfgContainer [2019-11-06 18:35:34,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:35:34,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:35:34,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:35:34,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:35:34,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:35:33" (1/3) ... [2019-11-06 18:35:34,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8ea7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:35:34, skipping insertion in model container [2019-11-06 18:35:34,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:35:34" (2/3) ... [2019-11-06 18:35:34,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8ea7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:35:34, skipping insertion in model container [2019-11-06 18:35:34,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:35:34" (3/3) ... [2019-11-06 18:35:34,639 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2019-11-06 18:35:34,649 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:35:34,656 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:35:34,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:35:34,691 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:35:34,691 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:35:34,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:35:34,692 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:35:34,693 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:35:34,693 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:35:34,693 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:35:34,693 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:35:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-06 18:35:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 18:35:34,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:35:34,717 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:35:34,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:35:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:35:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1089041636, now seen corresponding path program 1 times [2019-11-06 18:35:34,730 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:35:34,730 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327994086] [2019-11-06 18:35:34,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:35:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 18:35:35,018 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327994086] [2019-11-06 18:35:35,019 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:35:35,019 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:35:35,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899161706] [2019-11-06 18:35:35,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:35:35,026 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:35:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:35:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:35:35,046 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-11-06 18:35:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:35:35,182 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-11-06 18:35:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:35:35,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 18:35:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:35:35,193 INFO L225 Difference]: With dead ends: 57 [2019-11-06 18:35:35,193 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 18:35:35,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-06 18:35:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 18:35:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 18:35:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 18:35:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-06 18:35:35,241 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2019-11-06 18:35:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:35:35,242 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-06 18:35:35,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:35:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-06 18:35:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 18:35:35,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:35:35,245 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:35:35,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:35:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:35:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1200270940, now seen corresponding path program 1 times [2019-11-06 18:35:35,246 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:35:35,246 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504357268] [2019-11-06 18:35:35,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:35:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 18:35:35,427 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504357268] [2019-11-06 18:35:35,427 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:35:35,429 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:35:35,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918252281] [2019-11-06 18:35:35,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:35:35,433 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:35:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:35:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:35:35,434 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-11-06 18:35:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:35:35,544 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-11-06 18:35:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:35:35,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-06 18:35:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:35:35,546 INFO L225 Difference]: With dead ends: 47 [2019-11-06 18:35:35,547 INFO L226 Difference]: Without dead ends: 29 [2019-11-06 18:35:35,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:35:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-06 18:35:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-06 18:35:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 18:35:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-06 18:35:35,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 33 [2019-11-06 18:35:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:35:35,556 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-06 18:35:35,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:35:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-06 18:35:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 18:35:35,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:35:35,558 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 18:35:35,559 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:35:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:35:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 592534566, now seen corresponding path program 1 times [2019-11-06 18:35:35,559 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:35:35,560 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982508210] [2019-11-06 18:35:35,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:35:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 18:35:35,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982508210] [2019-11-06 18:35:35,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896933221] [2019-11-06 18:35:35,705 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-06 18:35:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:35,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:35:35,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:35:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 18:35:35,847 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:35:35,847 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-06 18:35:35,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040408969] [2019-11-06 18:35:35,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 18:35:35,849 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:35:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 18:35:35,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:35:35,850 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2019-11-06 18:35:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:35:36,079 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-06 18:35:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 18:35:36,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-06 18:35:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:35:36,081 INFO L225 Difference]: With dead ends: 51 [2019-11-06 18:35:36,081 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 18:35:36,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-06 18:35:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 18:35:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-06 18:35:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 18:35:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 18:35:36,090 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 35 [2019-11-06 18:35:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:35:36,104 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 18:35:36,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 18:35:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 18:35:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 18:35:36,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:35:36,106 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:35:36,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:35:36,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:35:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:35:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 476203942, now seen corresponding path program 1 times [2019-11-06 18:35:36,308 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:35:36,309 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507994754] [2019-11-06 18:35:36,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:35:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 18:35:36,450 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507994754] [2019-11-06 18:35:36,450 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018081178] [2019-11-06 18:35:36,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:35:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:35:36,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:35:36,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:35:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 18:35:36,543 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:35:36,543 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-06 18:35:36,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793140026] [2019-11-06 18:35:36,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:35:36,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:35:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:35:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:35:36,545 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-06 18:35:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:35:36,588 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-11-06 18:35:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:35:36,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-06 18:35:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:35:36,590 INFO L225 Difference]: With dead ends: 46 [2019-11-06 18:35:36,590 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 18:35:36,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:35:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 18:35:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-06 18:35:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 18:35:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 18:35:36,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 43 [2019-11-06 18:35:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:35:36,600 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 18:35:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:35:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 18:35:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 18:35:36,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:35:36,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-06 18:35:36,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:35:36,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:35:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:35:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -106794812, now seen corresponding path program 1 times [2019-11-06 18:35:36,808 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:35:36,808 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299951423] [2019-11-06 18:35:36,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:35:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 18:35:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 18:35:37,011 INFO L172 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-06 18:35:37,011 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-06 18:35:37,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:35:37 BoogieIcfgContainer [2019-11-06 18:35:37,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 18:35:37,087 INFO L168 Benchmark]: Toolchain (without parser) took 3270.48 ms. Allocated memory was 142.1 MB in the beginning and 269.0 MB in the end (delta: 126.9 MB). Free memory was 100.1 MB in the beginning and 191.3 MB in the end (delta: -91.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,090 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 142.1 MB in the beginning and 178.3 MB in the end (delta: 36.2 MB). Free memory was 99.9 MB in the beginning and 148.1 MB in the end (delta: -48.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,094 INFO L168 Benchmark]: Boogie Preprocessor took 121.47 ms. Allocated memory was 178.3 MB in the beginning and 215.5 MB in the end (delta: 37.2 MB). Free memory was 148.1 MB in the beginning and 200.4 MB in the end (delta: -52.3 MB). Peak memory consumption was 8.2 kB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,098 INFO L168 Benchmark]: RCFGBuilder took 353.09 ms. Allocated memory is still 215.5 MB. Free memory was 200.4 MB in the beginning and 182.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,099 INFO L168 Benchmark]: TraceAbstraction took 2463.64 ms. Allocated memory was 215.5 MB in the beginning and 269.0 MB in the end (delta: 53.5 MB). Free memory was 182.1 MB in the beginning and 191.3 MB in the end (delta: -9.2 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-11-06 18:35:37,105 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.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 142.1 MB in the beginning and 178.3 MB in the end (delta: 36.2 MB). Free memory was 99.9 MB in the beginning and 148.1 MB in the end (delta: -48.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.47 ms. Allocated memory was 178.3 MB in the beginning and 215.5 MB in the end (delta: 37.2 MB). Free memory was 148.1 MB in the beginning and 200.4 MB in the end (delta: -52.3 MB). Peak memory consumption was 8.2 kB. Max. memory is 7.1 GB. * RCFGBuilder took 353.09 ms. Allocated memory is still 215.5 MB. Free memory was 200.4 MB in the beginning and 182.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2463.64 ms. Allocated memory was 215.5 MB in the beginning and 269.0 MB in the end (delta: 53.5 MB). Free memory was 182.1 MB in the beginning and 191.3 MB in the end (delta: -9.2 MB). Peak memory consumption was 44.3 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 bitwiseAnd at line 14. Possible FailurePath: [L6] int N; VAL [\old(N)=10, 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 [\old(N)=0, i=0, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=1, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}] [L29] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={1:0}] [L34] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=0, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L16] return res; VAL [\old(N)=0, \result=0, i=2, N=2, res=0, x={1:0}, x={1:0}] [L34] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=0, i=2, N=2, x={1:0}] [L34] ret = bAnd(x) [L36] EXPR x[0] [L36] temp=x[0] [L36] EXPR x[1] [L36] x[0] = x[1] [L36] x[1] = temp VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}] [L37] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=1, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L16] return res; VAL [\old(N)=0, \result=-2, i=2, N=2, res=4294967294, x={1:0}, x={1:0}] [L37] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-2, i=2, N=2, ret=0, temp=0, x={1:0}] [L37] ret2 = bAnd(x) [L38] EXPR x[0] [L38] temp=x[0] [L39] int i =0 ; VAL [\old(N)=0, i=0, i=2, N=2, ret=0, ret2=-2, temp=1, x={1:0}] [L39] COND TRUE i