./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/ddlm2013.i --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/loop-lit/ddlm2013.i -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 17744505b3a424a40a1b2449004fea58677c1b94 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:02:29,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:02:29,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:02:29,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:02:29,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:02:29,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:02:29,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:02:29,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:02:29,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:02:29,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:02:29,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:02:29,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:02:29,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:02:29,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:02:29,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:02:29,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:02:29,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:02:29,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:02:29,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:02:29,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:02:29,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:02:29,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:02:29,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:02:29,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:02:29,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:02:29,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:02:29,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:02:29,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:02:29,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:02:29,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:02:29,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:02:29,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:02:29,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:02:29,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:02:29,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:02:29,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:02:29,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:02:29,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:02:29,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:02:29,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:02:29,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:02:29,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:02:29,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:02:29,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:02:29,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:02:29,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:02:29,371 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:02:29,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:02:29,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:02:29,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:02:29,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:02:29,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:02:29,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:02:29,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:02:29,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:02:29,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:02:29,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:02:29,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:02:29,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:02:29,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:02:29,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:02:29,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:02:29,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:02:29,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:02:29,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:02:29,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:02:29,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:02:29,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:02:29,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:02:29,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:02:29,377 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 -> 17744505b3a424a40a1b2449004fea58677c1b94 [2019-11-28 00:02:29,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:02:29,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:02:29,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:02:29,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:02:29,699 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:02:29,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/ddlm2013.i [2019-11-28 00:02:29,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea46ed30/f5bf736218a94f6ab3622d92488f0778/FLAG9cd733477 [2019-11-28 00:02:30,148 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:02:30,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/ddlm2013.i [2019-11-28 00:02:30,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea46ed30/f5bf736218a94f6ab3622d92488f0778/FLAG9cd733477 [2019-11-28 00:02:30,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea46ed30/f5bf736218a94f6ab3622d92488f0778 [2019-11-28 00:02:30,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:02:30,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:02:30,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:30,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:02:30,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:02:30,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bba22f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30, skipping insertion in model container [2019-11-28 00:02:30,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:02:30,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:02:30,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:30,852 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:02:30,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:30,884 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:02:30,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30 WrapperNode [2019-11-28 00:02:30,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:30,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:30,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:02:30,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:02:30,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:30,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:02:30,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:02:30,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:02:30,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:30,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:31,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:31,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:31,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (1/1) ... [2019-11-28 00:02:31,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:02:31,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:02:31,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:02:31,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:02:31,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (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-28 00:02:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:02:31,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:02:31,314 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:02:31,314 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 00:02:31,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:31 BoogieIcfgContainer [2019-11-28 00:02:31,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:02:31,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:02:31,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:02:31,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:02:31,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:02:30" (1/3) ... [2019-11-28 00:02:31,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a48de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:31, skipping insertion in model container [2019-11-28 00:02:31,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:30" (2/3) ... [2019-11-28 00:02:31,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a48de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:31, skipping insertion in model container [2019-11-28 00:02:31,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:31" (3/3) ... [2019-11-28 00:02:31,323 INFO L109 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2019-11-28 00:02:31,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:02:31,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:02:31,352 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:02:31,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:02:31,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:02:31,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:02:31,376 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:02:31,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:02:31,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:02:31,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:02:31,377 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:02:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-11-28 00:02:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 00:02:31,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:31,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 00:02:31,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 920569802, now seen corresponding path program 1 times [2019-11-28 00:02:31,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:31,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575978280] [2019-11-28 00:02:31,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:31,504 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-28 00:02:31,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575978280] [2019-11-28 00:02:31,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:31,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:02:31,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973450658] [2019-11-28 00:02:31,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:02:31,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:02:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:02:31,529 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-28 00:02:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:31,546 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-11-28 00:02:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:02:31,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 00:02:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:31,557 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:02:31,558 INFO L226 Difference]: Without dead ends: 9 [2019-11-28 00:02:31,561 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-28 00:02:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-28 00:02:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 00:02:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 00:02:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-28 00:02:31,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-11-28 00:02:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:31,593 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 00:02:31,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:02:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-11-28 00:02:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 00:02:31,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:31,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:31,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1539532969, now seen corresponding path program 1 times [2019-11-28 00:02:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:31,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78466550] [2019-11-28 00:02:31,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:31,863 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-28 00:02:31,879 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-28 00:02:31,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78466550] [2019-11-28 00:02:31,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:31,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:02:31,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992675620] [2019-11-28 00:02:31,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:31,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:31,883 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-11-28 00:02:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:31,946 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 00:02:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:31,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 00:02:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:31,947 INFO L225 Difference]: With dead ends: 15 [2019-11-28 00:02:31,947 INFO L226 Difference]: Without dead ends: 11 [2019-11-28 00:02:31,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-28 00:02:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 00:02:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 00:02:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-11-28 00:02:31,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2019-11-28 00:02:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:31,952 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-28 00:02:31,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-11-28 00:02:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:02:31,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:31,953 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:31,953 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:31,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1067556335, now seen corresponding path program 1 times [2019-11-28 00:02:31,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:31,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099898047] [2019-11-28 00:02:31,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:34,243 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_ULTIMATE.start_main_~b~0 4294967296)) (.cse3 (div c_ULTIMATE.start_main_~a~0 4294967296))) (let ((.cse6 (* 4294967296 .cse3)) (.cse16 (* 4294967296 .cse5))) (let ((.cse2 (+ c_ULTIMATE.start_main_~a~0 .cse16)) (.cse1 (+ .cse6 c_ULTIMATE.start_main_~b~0))) (let ((.cse0 (= .cse2 .cse1))) (or .cse0 (let ((.cse4 (not .cse0))) (and (or (<= .cse1 .cse2) (and (or (and (or (<= .cse3 0) (<= c_ULTIMATE.start_main_~a~0 1)) (or (and .cse4 (<= 1 c_ULTIMATE.start_main_~b~0)) (and .cse0 (<= 0 c_ULTIMATE.start_main_~b~0)) (< 0 .cse3))) (<= .cse3 .cse5)) (or (and .cse0 (<= (+ c_ULTIMATE.start_main_~b~0 1) c_ULTIMATE.start_main_~a~0)) (and .cse4 (<= c_ULTIMATE.start_main_~b~0 c_ULTIMATE.start_main_~a~0)) (< .cse5 .cse3)))) .cse4 (let ((.cse20 (div c_ULTIMATE.start_main_~i~0 2))) (let ((.cse9 (* 2 .cse20))) (let ((.cse19 (* .cse20 (- 2))) (.cse18 (= .cse9 c_ULTIMATE.start_main_~i~0)) (.cse17 (* 4294967296 (div c_ULTIMATE.start_main_~i~0 4294967296)))) (let ((.cse7 (+ c_ULTIMATE.start_main_~a~0 .cse16 c_ULTIMATE.start_main_~i~0)) (.cse11 (< c_ULTIMATE.start_main_~i~0 .cse17)) (.cse12 (not .cse18)) (.cse13 (* 4294967296 (div (+ c_ULTIMATE.start_main_~i~0 .cse19 (- 2)) 4294967296))) (.cse8 (* 4294967296 (div (+ c_ULTIMATE.start_main_~i~0 .cse19) 4294967296))) (.cse10 (or (<= .cse17 c_ULTIMATE.start_main_~i~0) .cse18))) (or (< .cse2 .cse1) (< .cse2 (+ .cse6 c_ULTIMATE.start_main_~b~0 1)) (and (<= .cse7 (+ .cse6 c_ULTIMATE.start_main_~b~0 .cse8 .cse9)) .cse10) (and .cse11 .cse12 (<= .cse7 (+ .cse6 .cse13 c_ULTIMATE.start_main_~b~0 .cse9))) (let ((.cse14 (+ .cse3 1))) (and (let ((.cse15 (+ .cse16 c_ULTIMATE.start_main_~i~0))) (or (<= .cse14 0) (and .cse11 .cse12 (<= (+ .cse6 .cse13 c_ULTIMATE.start_main_~b~0 .cse9 1) .cse15)) (and (<= (+ .cse6 c_ULTIMATE.start_main_~b~0 .cse8 .cse9 1) .cse15) .cse10))) (or (< 0 .cse14) (<= 1 c_ULTIMATE.start_main_~a~0)))))))))))))))) is different from false [2019-11-28 00:02:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:34,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099898047] [2019-11-28 00:02:34,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287436280] [2019-11-28 00:02:34,301 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-28 00:02:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:34,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:02:34,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:34,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:34,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-28 00:02:34,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53187435] [2019-11-28 00:02:34,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:02:34,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:02:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2019-11-28 00:02:34,471 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2019-11-28 00:02:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:34,548 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 00:02:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:34,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-11-28 00:02:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:34,550 INFO L225 Difference]: With dead ends: 20 [2019-11-28 00:02:34,550 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 00:02:34,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2019-11-28 00:02:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 00:02:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-28 00:02:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:02:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 00:02:34,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2019-11-28 00:02:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:34,555 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 00:02:34,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:02:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-11-28 00:02:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:02:34,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:34,556 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:34,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:34,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -387497965, now seen corresponding path program 1 times [2019-11-28 00:02:34,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:34,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176524011] [2019-11-28 00:02:34,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:02:34,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176524011] [2019-11-28 00:02:34,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:34,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:02:34,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531209538] [2019-11-28 00:02:34,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:02:34,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:02:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:02:34,805 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 3 states. [2019-11-28 00:02:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:34,816 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-28 00:02:34,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:02:34,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 00:02:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:34,819 INFO L225 Difference]: With dead ends: 23 [2019-11-28 00:02:34,819 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:02:34,819 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-28 00:02:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:02:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:02:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:02:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-28 00:02:34,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2019-11-28 00:02:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:34,823 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 00:02:34,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:02:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-28 00:02:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:34,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:34,824 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:34,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2134579945, now seen corresponding path program 2 times [2019-11-28 00:02:34,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:34,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063597722] [2019-11-28 00:02:34,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:37,301 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 79 DAG size of output: 25 [2019-11-28 00:02:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:37,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063597722] [2019-11-28 00:02:37,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252889884] [2019-11-28 00:02:37,387 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-28 00:02:37,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:02:37,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:37,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:02:37,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:37,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 00:02:37,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494575431] [2019-11-28 00:02:37,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:02:37,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:02:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:02:37,598 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2019-11-28 00:02:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:37,712 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-11-28 00:02:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:02:37,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-28 00:02:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:37,713 INFO L225 Difference]: With dead ends: 28 [2019-11-28 00:02:37,714 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:02:37,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:02:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:02:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:02:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:02:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 00:02:37,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-11-28 00:02:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 00:02:37,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:02:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-28 00:02:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:02:37,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:37,723 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:37,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:37,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:37,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1512979537, now seen corresponding path program 3 times [2019-11-28 00:02:37,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:37,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080038691] [2019-11-28 00:02:37,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:40,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080038691] [2019-11-28 00:02:40,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497207074] [2019-11-28 00:02:40,738 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-28 00:02:40,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:02:40,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:40,774 WARN L253 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 00:02:40,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:40,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:40,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-28 00:02:40,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585042592] [2019-11-28 00:02:40,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:02:40,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:02:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2019-11-28 00:02:40,999 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 18 states. [2019-11-28 00:02:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:41,401 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-28 00:02:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:02:41,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-11-28 00:02:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:41,402 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:02:41,402 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:02:41,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=110, Invalid=539, Unknown=1, NotChecked=0, Total=650 [2019-11-28 00:02:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:02:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:02:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:02:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 00:02:41,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-28 00:02:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 00:02:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:02:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-28 00:02:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:02:41,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:41,409 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:41,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:41,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash -329989927, now seen corresponding path program 1 times [2019-11-28 00:02:41,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:41,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142967691] [2019-11-28 00:02:41,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:41,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142967691] [2019-11-28 00:02:41,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614565376] [2019-11-28 00:02:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 00:02:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:41,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 00:02:41,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:02:41,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:41,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 00:02:41,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302495754] [2019-11-28 00:02:41,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:02:41,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:41,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:02:41,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:02:41,941 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-11-28 00:02:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:42,025 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-28 00:02:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:02:42,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 00:02:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:42,027 INFO L225 Difference]: With dead ends: 35 [2019-11-28 00:02:42,027 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:02:42,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:02:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:02:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:02:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:02:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 00:02:42,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-28 00:02:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:42,032 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 00:02:42,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:02:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 00:02:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:02:42,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:42,034 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:42,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:42,238 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1603113111, now seen corresponding path program 4 times [2019-11-28 00:02:42,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:42,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409808221] [2019-11-28 00:02:42,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:45,025 WARN L192 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-28 00:02:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:47,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409808221] [2019-11-28 00:02:47,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387278031] [2019-11-28 00:02:47,305 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 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-28 00:02:47,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:02:47,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:47,340 WARN L253 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-28 00:02:47,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:48,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:48,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2019-11-28 00:02:48,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372233802] [2019-11-28 00:02:48,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 00:02:48,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 00:02:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:02:48,131 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 30 states. [2019-11-28 00:02:50,459 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-28 00:02:52,135 WARN L192 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2019-11-28 00:02:52,305 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-11-28 00:02:54,576 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 89 DAG size of output: 32 [2019-11-28 00:02:56,697 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2019-11-28 00:02:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:57,133 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 00:02:57,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:02:57,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-11-28 00:02:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:57,134 INFO L225 Difference]: With dead ends: 31 [2019-11-28 00:02:57,134 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:57,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:02:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:57,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-28 00:02:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:57,136 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:57,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 00:02:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:57,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:57,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:57,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:57,354 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:57,354 INFO L249 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2019-11-28 00:02:57,354 INFO L246 CegarLoopResult]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-11-28 00:02:57,354 INFO L246 CegarLoopResult]: For program point L25-2(lines 10 35) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point L21(lines 21 30) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point L21-2(lines 10 35) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L249 CegarLoopResult]: At program point L34(lines 10 35) the Hoare annotation is: true [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:57,355 INFO L246 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-28 00:02:57,356 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:57,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:57 BoogieIcfgContainer [2019-11-28 00:02:57,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:57,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:57,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:57,367 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:57,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:31" (3/4) ... [2019-11-28 00:02:57,371 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:57,382 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 00:02:57,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:57,437 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:57,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:57,439 INFO L168 Benchmark]: Toolchain (without parser) took 26862.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 956.3 MB in the beginning and 906.2 MB in the end (delta: 50.2 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,440 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:57,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.22 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,442 INFO L168 Benchmark]: Boogie Preprocessor took 41.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,446 INFO L168 Benchmark]: RCFGBuilder took 294.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,447 INFO L168 Benchmark]: TraceAbstraction took 26049.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 191.0 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:57,447 INFO L168 Benchmark]: Witness Printer took 70.91 ms. Allocated memory is still 1.2 GB. Free memory is still 906.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:57,452 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.22 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 294.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26049.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 191.0 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. * Witness Printer took 70.91 ms. Allocated memory is still 1.2 GB. Free memory is still 906.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Result: SAFE, OverallTime: 25.9s, OverallIterations: 8, TraceHistogramMax: 7, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 74 SDslu, 333 SDs, 0 SdLazy, 475 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, 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, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 176 ConstructedInterpolants, 4 QuantifiedInterpolants, 50653 SizeOfPredicates, 21 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 25/216 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 correct! Received shutdown request...