./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test27-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe25ce750efb74d780ec4e5d4c6de923e91c57e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:53:27,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:53:27,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:53:27,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:53:27,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:53:27,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:53:27,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:53:27,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:53:27,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:53:27,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:53:27,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:53:27,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:53:27,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:53:27,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:53:27,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:53:27,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:53:27,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:53:27,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:53:27,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:53:27,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:53:27,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:53:27,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:53:27,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:53:27,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:53:27,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:53:27,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:53:27,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:53:27,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:53:27,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:53:27,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:53:27,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:53:27,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:53:27,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:53:27,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:53:27,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:53:27,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:53:27,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:53:27,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:53:27,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:53:27,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:53:27,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:53:27,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:53:27,371 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:53:27,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:53:27,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:53:27,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:53:27,375 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:53:27,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:53:27,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:53:27,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:53:27,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:53:27,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:53:27,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:53:27,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:53:27,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:53:27,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:53:27,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:53:27,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:53:27,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:53:27,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:53:27,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:53:27,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:53:27,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:53:27,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:27,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:53:27,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:53:27,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:53:27,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:53:27,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:53:27,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:53:27,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfe25ce750efb74d780ec4e5d4c6de923e91c57e [2019-11-27 23:53:27,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:53:27,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:53:27,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:53:27,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:53:27,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:53:27,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-27 23:53:27,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eb97df9/11f966d748e94071bacd2492b3d0b90f/FLAG112e56e2f [2019-11-27 23:53:28,303 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:53:28,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-27 23:53:28,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eb97df9/11f966d748e94071bacd2492b3d0b90f/FLAG112e56e2f [2019-11-27 23:53:28,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eb97df9/11f966d748e94071bacd2492b3d0b90f [2019-11-27 23:53:28,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:53:28,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:53:28,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:28,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:53:28,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:53:28,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:28" (1/1) ... [2019-11-27 23:53:28,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af92336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:28, skipping insertion in model container [2019-11-27 23:53:28,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:28" (1/1) ... [2019-11-27 23:53:28,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:53:28,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:53:29,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:29,026 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:53:29,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:29,121 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:53:29,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29 WrapperNode [2019-11-27 23:53:29,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:29,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:29,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:53:29,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:53:29,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:29,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:53:29,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:53:29,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:53:29,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (1/1) ... [2019-11-27 23:53:29,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:53:29,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:53:29,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:53:29,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:53:29,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (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-27 23:53:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:53:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:53:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:53:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:53:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:53:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:53:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:53:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:53:29,602 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:53:29,603 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-27 23:53:29,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:29 BoogieIcfgContainer [2019-11-27 23:53:29,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:53:29,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:53:29,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:53:29,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:53:29,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:53:28" (1/3) ... [2019-11-27 23:53:29,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c550cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:29, skipping insertion in model container [2019-11-27 23:53:29,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:29" (2/3) ... [2019-11-27 23:53:29,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c550cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:29, skipping insertion in model container [2019-11-27 23:53:29,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:29" (3/3) ... [2019-11-27 23:53:29,620 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-2.c [2019-11-27 23:53:29,642 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:53:29,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:53:29,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:53:29,702 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:53:29,703 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:53:29,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:53:29,703 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:53:29,703 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:53:29,703 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:53:29,704 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:53:29,704 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:53:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-27 23:53:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:53:29,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:29,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:29,725 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-11-27 23:53:29,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:29,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426616271] [2019-11-27 23:53:29,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:29,889 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-27 23:53:29,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426616271] [2019-11-27 23:53:29,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:29,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:53:29,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397483218] [2019-11-27 23:53:29,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:53:29,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:53:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:53:29,912 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-27 23:53:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:29,927 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-27 23:53:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:53:29,929 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:53:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:29,938 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:53:29,938 INFO L226 Difference]: Without dead ends: 13 [2019-11-27 23:53:29,942 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-27 23:53:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-27 23:53:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-27 23:53:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-27 23:53:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-27 23:53:29,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-11-27 23:53:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:29,976 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-27 23:53:29,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:53:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-11-27 23:53:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:53:29,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:29,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:29,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-11-27 23:53:29,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:29,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024234792] [2019-11-27 23:53:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:30,057 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-27 23:53:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024234792] [2019-11-27 23:53:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:30,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420715993] [2019-11-27 23:53:30,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:30,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:30,061 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-11-27 23:53:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:30,095 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-27 23:53:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:30,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 23:53:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:30,097 INFO L225 Difference]: With dead ends: 24 [2019-11-27 23:53:30,098 INFO L226 Difference]: Without dead ends: 15 [2019-11-27 23:53:30,099 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-27 23:53:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-27 23:53:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-27 23:53:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-27 23:53:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-27 23:53:30,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-11-27 23:53:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:30,106 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-27 23:53:30,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-27 23:53:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:53:30,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:30,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:30,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-11-27 23:53:30,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:30,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480997233] [2019-11-27 23:53:30,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:30,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480997233] [2019-11-27 23:53:30,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417341779] [2019-11-27 23:53:30,234 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-27 23:53:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:30,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:53:30,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:30,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:30,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 23:53:30,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062263291] [2019-11-27 23:53:30,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:30,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:30,368 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-11-27 23:53:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:30,406 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-27 23:53:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:53:30,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-27 23:53:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:30,408 INFO L225 Difference]: With dead ends: 26 [2019-11-27 23:53:30,408 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 23:53:30,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 23:53:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-27 23:53:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 23:53:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-11-27 23:53:30,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-11-27 23:53:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:30,417 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-27 23:53:30,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-11-27 23:53:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:30,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:30,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:30,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:30,623 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-11-27 23:53:30,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:30,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8428438] [2019-11-27 23:53:30,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:30,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8428438] [2019-11-27 23:53:30,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005210428] [2019-11-27 23:53:30,749 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-27 23:53:30,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:53:30,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:30,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:53:30,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:30,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:30,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-27 23:53:30,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693749028] [2019-11-27 23:53:30,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:53:30,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:30,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:53:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:53:30,861 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-11-27 23:53:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:30,896 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-11-27 23:53:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:30,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-27 23:53:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:30,898 INFO L225 Difference]: With dead ends: 28 [2019-11-27 23:53:30,898 INFO L226 Difference]: Without dead ends: 19 [2019-11-27 23:53:30,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:53:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-27 23:53:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-27 23:53:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 23:53:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-27 23:53:30,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-11-27 23:53:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:30,904 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-27 23:53:30,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:53:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-27 23:53:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:53:30,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:30,905 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:31,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:31,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash 123871506, now seen corresponding path program 3 times [2019-11-27 23:53:31,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:31,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602208285] [2019-11-27 23:53:31,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:31,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602208285] [2019-11-27 23:53:31,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028230801] [2019-11-27 23:53:31,192 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:31,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-27 23:53:31,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:31,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:53:31,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:31,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:31,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-27 23:53:31,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198585161] [2019-11-27 23:53:31,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:53:31,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:53:31,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:31,398 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-11-27 23:53:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:31,439 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-27 23:53:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:53:31,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-27 23:53:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:31,441 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:53:31,442 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 23:53:31,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 23:53:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-27 23:53:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 23:53:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-27 23:53:31,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-11-27 23:53:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:31,451 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-27 23:53:31,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:53:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-27 23:53:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:31,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:31,453 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:31,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:31,661 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1444204464, now seen corresponding path program 4 times [2019-11-27 23:53:31,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:31,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-27 23:53:31,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:31,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-27 23:53:31,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767581154] [2019-11-27 23:53:31,786 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:31,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 23:53:31,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:31,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:53:31,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:31,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:31,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-27 23:53:31,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755917973] [2019-11-27 23:53:31,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:53:31,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:53:31,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:53:31,905 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-11-27 23:53:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:31,985 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-27 23:53:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:53:31,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 23:53:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:31,988 INFO L225 Difference]: With dead ends: 32 [2019-11-27 23:53:31,988 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 23:53:31,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:53:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 23:53:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 23:53:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:53:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-27 23:53:31,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-11-27 23:53:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:31,998 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-27 23:53:31,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:53:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-27 23:53:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:53:31,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:31,999 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:32,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:32,204 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -831690738, now seen corresponding path program 5 times [2019-11-27 23:53:32,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:32,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489438827] [2019-11-27 23:53:32,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:32,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489438827] [2019-11-27 23:53:32,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88818166] [2019-11-27 23:53:32,362 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:33,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-27 23:53:33,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:33,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:53:33,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:33,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:33,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-27 23:53:33,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235563501] [2019-11-27 23:53:33,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:53:33,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:33,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:53:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:53:33,278 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2019-11-27 23:53:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:33,323 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-27 23:53:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:53:33,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-27 23:53:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:33,325 INFO L225 Difference]: With dead ends: 34 [2019-11-27 23:53:33,325 INFO L226 Difference]: Without dead ends: 25 [2019-11-27 23:53:33,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:53:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-27 23:53:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-27 23:53:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 23:53:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-27 23:53:33,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-11-27 23:53:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:33,332 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-27 23:53:33,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:53:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-27 23:53:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:53:33,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:33,333 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:33,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:33,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash -616519604, now seen corresponding path program 6 times [2019-11-27 23:53:33,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:33,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764794149] [2019-11-27 23:53:33,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:33,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764794149] [2019-11-27 23:53:33,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132142363] [2019-11-27 23:53:33,684 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:35,368 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-27 23:53:35,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:35,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:53:35,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:35,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:35,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-27 23:53:35,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91472558] [2019-11-27 23:53:35,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:53:35,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:53:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:35,392 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2019-11-27 23:53:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:35,459 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-27 23:53:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:53:35,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-27 23:53:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:35,464 INFO L225 Difference]: With dead ends: 36 [2019-11-27 23:53:35,466 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:53:35,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:53:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-27 23:53:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 23:53:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-27 23:53:35,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-11-27 23:53:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:35,480 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-27 23:53:35,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:53:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-27 23:53:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:35,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:35,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:35,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:35,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 4509962, now seen corresponding path program 7 times [2019-11-27 23:53:35,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:35,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705452480] [2019-11-27 23:53:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:35,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705452480] [2019-11-27 23:53:35,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731225098] [2019-11-27 23:53:35,821 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:35,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:53:35,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:35,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:35,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-27 23:53:35,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608911650] [2019-11-27 23:53:35,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:53:35,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:53:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:53:35,908 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2019-11-27 23:53:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:35,966 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-27 23:53:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:53:35,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-27 23:53:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:35,968 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:53:35,968 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:53:35,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:53:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:53:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-27 23:53:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:53:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-27 23:53:35,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-11-27 23:53:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:35,975 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-27 23:53:35,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:53:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-27 23:53:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:53:35,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:35,976 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:36,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:36,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -186531256, now seen corresponding path program 8 times [2019-11-27 23:53:36,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:36,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-27 23:53:36,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:36,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-27 23:53:36,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481118786] [2019-11-27 23:53:36,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:36,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:53:36,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:36,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 23:53:36,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:36,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:36,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-27 23:53:36,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450008643] [2019-11-27 23:53:36,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:53:36,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:53:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:53:36,460 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-11-27 23:53:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:36,534 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-27 23:53:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:53:36,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-27 23:53:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:36,538 INFO L225 Difference]: With dead ends: 40 [2019-11-27 23:53:36,538 INFO L226 Difference]: Without dead ends: 31 [2019-11-27 23:53:36,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:53:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-27 23:53:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-27 23:53:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-27 23:53:36,547 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-11-27 23:53:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:36,547 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-27 23:53:36,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:53:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-27 23:53:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:53:36,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:36,548 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:36,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:36,754 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 906451974, now seen corresponding path program 9 times [2019-11-27 23:53:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:36,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440498955] [2019-11-27 23:53:36,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:36,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440498955] [2019-11-27 23:53:36,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060403905] [2019-11-27 23:53:36,867 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:50,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-27 23:53:50,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:50,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:53:50,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:50,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:50,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-27 23:53:50,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396257804] [2019-11-27 23:53:50,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 23:53:50,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 23:53:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:53:50,488 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 13 states. [2019-11-27 23:53:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:50,569 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-27 23:53:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:50,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-11-27 23:53:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:50,574 INFO L225 Difference]: With dead ends: 41 [2019-11-27 23:53:50,574 INFO L226 Difference]: Without dead ends: 32 [2019-11-27 23:53:50,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:53:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-27 23:53:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-27 23:53:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:53:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-27 23:53:50,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-11-27 23:53:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:50,585 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-27 23:53:50,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 23:53:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-27 23:53:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:53:50,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:50,588 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:50,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:50,790 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1003651516, now seen corresponding path program 10 times [2019-11-27 23:53:50,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860554332] [2019-11-27 23:53:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:51,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:53:51,147 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:53:51,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:53:51 BoogieIcfgContainer [2019-11-27 23:53:51,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:53:51,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:53:51,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:53:51,233 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:53:51,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:29" (3/4) ... [2019-11-27 23:53:51,238 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:53:51,373 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:53:51,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:53:51,376 INFO L168 Benchmark]: Toolchain (without parser) took 22666.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,377 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:51,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,379 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:51,379 INFO L168 Benchmark]: RCFGBuilder took 409.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,380 INFO L168 Benchmark]: TraceAbstraction took 21626.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.7 MB). Peak memory consumption was 116.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,380 INFO L168 Benchmark]: Witness Printer took 140.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:51,384 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21626.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.7 MB). Peak memory consumption was 116.8 MB. Max. memory is 11.5 GB. * Witness Printer took 140.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] struct cont cont; [L22] struct dummy dummy; [L23] struct dummy *dummies[10]; [L24] int a[10]; [L25] int i, *pa; [L26] i = __VERIFIER_nondet_int() [L27] int j = 0; [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND TRUE j < 10 [L28] a[j] = __VERIFIER_nondet_int() [L32] dummies[j] = 0 [L27] j++ [L27] COND FALSE !(j < 10) [L34] COND TRUE i >= 0 && i < 9 [L35] a[i] = i [L36] dummy.array = &a[i] [L37] dummies[i + 1] = &dummy [L38] cont.array = &dummies[0] [L39] EXPR cont.array [L39] EXPR cont.array[i] [L39] EXPR cont.array[i]->array [L39] pa = &cont.array[i]->array[i] [L40] EXPR a[i] [L40] COND TRUE a[i] > 0 [L41] EXPR dummies[i + 1] [L41] EXPR dummies[i + 1]->array [L41] EXPR dummies[i + 1]->array[i] [L41] i = dummies[i + 1]->array[i] - 10 [L42] EXPR \read(*pa) [L42] COND FALSE !(i < *pa) [L16] EXPR pc->array [L16] EXPR pc->array[i] [L16] EXPR pc->array[i]->array [L16] EXPR pc->array[i]->array[i] [L16] return pc->array[i]->array[i] == i; [L45] COND TRUE !check(&cont, i) [L53] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 21.4s, OverallIterations: 12, TraceHistogramMax: 10, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 140 SDtfs, 55 SDslu, 520 SDs, 0 SdLazy, 189 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 16.9s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 16761 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...