/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.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 ebf754a3963f6f2e62a58c5af4648497776f95f2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ebf754a3963f6f2e62a58c5af4648497776f95f2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 13:56:17,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 13:56:17,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 13:56:17,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 13:56:17,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 13:56:17,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 13:56:17,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 13:56:17,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 13:56:17,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 13:56:17,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 13:56:17,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 13:56:17,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 13:56:17,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 13:56:17,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 13:56:17,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 13:56:17,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 13:56:17,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 13:56:17,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 13:56:17,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 13:56:17,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 13:56:17,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 13:56:17,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 13:56:17,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 13:56:17,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 13:56:17,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 13:56:17,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 13:56:17,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 13:56:17,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 13:56:17,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 13:56:17,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 13:56:17,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 13:56:17,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 13:56:17,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 13:56:17,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 13:56:17,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 13:56:17,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 13:56:17,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 13:56:17,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 13:56:17,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 13:56:17,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 13:56:17,410 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 13:56:17,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 13:56:17,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 13:56:17,411 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 13:56:17,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 13:56:17,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 13:56:17,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 13:56:17,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 13:56:17,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 13:56:17,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 13:56:17,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 13:56:17,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 13:56:17,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 13:56:17,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 13:56:17,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 13:56:17,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 13:56:17,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 13:56:17,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 13:56:17,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 13:56:17,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:17,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 13:56:17,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 13:56:17,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 13:56:17,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 13:56:17,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 13:56:17,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 13:56:17,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> ebf754a3963f6f2e62a58c5af4648497776f95f2 [2018-09-20 13:56:17,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 13:56:17,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 13:56:17,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 13:56:17,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 13:56:17,504 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 13:56:17,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:17,855 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c9c27e1/3f19bdf16c1a4d3b86b7cfa3ba74668b/FLAG0cbb60ee3 [2018-09-20 13:56:18,005 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 13:56:18,006 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:18,013 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c9c27e1/3f19bdf16c1a4d3b86b7cfa3ba74668b/FLAG0cbb60ee3 [2018-09-20 13:56:18,029 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c9c27e1/3f19bdf16c1a4d3b86b7cfa3ba74668b [2018-09-20 13:56:18,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 13:56:18,036 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 13:56:18,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:18,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 13:56:18,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 13:56:18,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef4c521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18, skipping insertion in model container [2018-09-20 13:56:18,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,066 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 13:56:18,327 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:18,343 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 13:56:18,348 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:18,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18 WrapperNode [2018-09-20 13:56:18,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:18,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 13:56:18,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 13:56:18,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 13:56:18,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... [2018-09-20 13:56:18,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 13:56:18,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 13:56:18,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 13:56:18,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 13:56:18,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 13:56:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 13:56:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 13:56:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 13:56:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 13:56:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 13:56:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 13:56:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 13:56:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 13:56:18,744 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 13:56:18,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:18 BoogieIcfgContainer [2018-09-20 13:56:18,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 13:56:18,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 13:56:18,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 13:56:18,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 13:56:18,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:56:18" (1/3) ... [2018-09-20 13:56:18,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7785a4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:18, skipping insertion in model container [2018-09-20 13:56:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:18" (2/3) ... [2018-09-20 13:56:18,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7785a4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:18, skipping insertion in model container [2018-09-20 13:56:18,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:18" (3/3) ... [2018-09-20 13:56:18,755 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:18,765 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 13:56:18,774 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 13:56:18,833 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 13:56:18,834 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 13:56:18,834 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 13:56:18,835 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 13:56:18,835 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 13:56:18,835 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 13:56:18,835 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 13:56:18,835 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 13:56:18,836 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 13:56:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-20 13:56:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-20 13:56:18,864 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:18,865 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:18,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-09-20 13:56:18,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:18,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:18,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:18,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:56:18,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 13:56:18,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 13:56:19,007 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 13:56:19,008 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 13:56:19,011 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-09-20 13:56:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:19,033 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-09-20 13:56:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 13:56:19,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-20 13:56:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:19,044 INFO L225 Difference]: With dead ends: 32 [2018-09-20 13:56:19,044 INFO L226 Difference]: Without dead ends: 13 [2018-09-20 13:56:19,049 INFO L606 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 [2018-09-20 13:56:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-20 13:56:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-20 13:56:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-20 13:56:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-20 13:56:19,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-20 13:56:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:19,089 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-20 13:56:19,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 13:56:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-20 13:56:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-20 13:56:19,090 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:19,090 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:19,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:19,091 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-09-20 13:56:19,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:19,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:19,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:56:19,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 13:56:19,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 13:56:19,178 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 13:56:19,178 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 13:56:19,178 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-09-20 13:56:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:19,261 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-20 13:56:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 13:56:19,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-20 13:56:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:19,265 INFO L225 Difference]: With dead ends: 21 [2018-09-20 13:56:19,265 INFO L226 Difference]: Without dead ends: 16 [2018-09-20 13:56:19,267 INFO L606 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 [2018-09-20 13:56:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-20 13:56:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-20 13:56:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-20 13:56:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-20 13:56:19,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-09-20 13:56:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:19,281 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-20 13:56:19,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 13:56:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-20 13:56:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-20 13:56:19,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:19,283 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:19,285 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-09-20 13:56:19,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:19,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:19,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:19,489 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:19,489 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:19,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:19,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:19,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-20 13:56:19,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 13:56:19,638 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 13:56:19,638 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-20 13:56:19,638 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-09-20 13:56:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:19,741 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-20 13:56:19,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 13:56:19,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-09-20 13:56:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:19,743 INFO L225 Difference]: With dead ends: 24 [2018-09-20 13:56:19,743 INFO L226 Difference]: Without dead ends: 19 [2018-09-20 13:56:19,744 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-20 13:56:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-20 13:56:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-20 13:56:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-20 13:56:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-20 13:56:19,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-09-20 13:56:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:19,750 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-20 13:56:19,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 13:56:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-20 13:56:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-20 13:56:19,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:19,752 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:19,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash -489337255, now seen corresponding path program 2 times [2018-09-20 13:56:19,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:19,857 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:19,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-20 13:56:19,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 13:56:19,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:19,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:19,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:19,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-20 13:56:19,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 13:56:19,950 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 13:56:19,951 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-20 13:56:19,951 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-09-20 13:56:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:19,987 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-20 13:56:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 13:56:19,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-09-20 13:56:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:19,989 INFO L225 Difference]: With dead ends: 27 [2018-09-20 13:56:19,990 INFO L226 Difference]: Without dead ends: 22 [2018-09-20 13:56:19,991 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-20 13:56:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-20 13:56:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-20 13:56:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-20 13:56:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-20 13:56:19,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-09-20 13:56:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-20 13:56:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 13:56:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-20 13:56:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-20 13:56:19,998 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:19,998 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:19,999 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash -169763, now seen corresponding path program 3 times [2018-09-20 13:56:20,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:20,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:20,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:20,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-20 13:56:20,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-20 13:56:20,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:20,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:20,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:20,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-20 13:56:20,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-20 13:56:20,293 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-20 13:56:20,293 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-20 13:56:20,294 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-09-20 13:56:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:20,500 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-20 13:56:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-20 13:56:20,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-09-20 13:56:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:20,503 INFO L225 Difference]: With dead ends: 30 [2018-09-20 13:56:20,503 INFO L226 Difference]: Without dead ends: 25 [2018-09-20 13:56:20,504 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-20 13:56:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-20 13:56:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-20 13:56:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-20 13:56:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-20 13:56:20,511 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-09-20 13:56:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:20,511 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-20 13:56:20,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-20 13:56:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-20 13:56:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-20 13:56:20,513 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:20,514 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:20,514 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 4 times [2018-09-20 13:56:20,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:20,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:20,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:20,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:20,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-20 13:56:20,657 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-20 13:56:20,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:20,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:20,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:20,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-20 13:56:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-20 13:56:20,696 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-20 13:56:20,696 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-20 13:56:20,698 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-09-20 13:56:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:20,757 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-20 13:56:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-20 13:56:20,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-09-20 13:56:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:20,760 INFO L225 Difference]: With dead ends: 33 [2018-09-20 13:56:20,760 INFO L226 Difference]: Without dead ends: 28 [2018-09-20 13:56:20,760 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-20 13:56:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-20 13:56:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-20 13:56:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-20 13:56:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-20 13:56:20,766 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-09-20 13:56:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-20 13:56:20,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-20 13:56:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-20 13:56:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-20 13:56:20,768 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:20,768 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:20,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1170618205, now seen corresponding path program 5 times [2018-09-20 13:56:20,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:20,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:20,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:20,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,000 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:21,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:21,014 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-20 13:56:21,042 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-20 13:56:21,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:21,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:21,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-20 13:56:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 13:56:21,087 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 13:56:21,087 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-20 13:56:21,088 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-09-20 13:56:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:21,134 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-20 13:56:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-20 13:56:21,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-09-20 13:56:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:21,136 INFO L225 Difference]: With dead ends: 36 [2018-09-20 13:56:21,136 INFO L226 Difference]: Without dead ends: 31 [2018-09-20 13:56:21,137 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-20 13:56:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-20 13:56:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-20 13:56:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-20 13:56:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-20 13:56:21,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-09-20 13:56:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:21,146 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-20 13:56:21,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 13:56:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-20 13:56:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-20 13:56:21,147 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:21,147 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:21,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -520507047, now seen corresponding path program 6 times [2018-09-20 13:56:21,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:21,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:21,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:21,311 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-20 13:56:21,350 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-20 13:56:21,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:21,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:21,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-20 13:56:21,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 13:56:21,388 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 13:56:21,388 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-20 13:56:21,390 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-09-20 13:56:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:21,492 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-20 13:56:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-20 13:56:21,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-09-20 13:56:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:21,498 INFO L225 Difference]: With dead ends: 39 [2018-09-20 13:56:21,498 INFO L226 Difference]: Without dead ends: 34 [2018-09-20 13:56:21,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-20 13:56:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-20 13:56:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-20 13:56:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-20 13:56:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-20 13:56:21,504 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-09-20 13:56:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:21,505 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-20 13:56:21,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 13:56:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-20 13:56:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 13:56:21,506 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:21,506 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:21,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -866507299, now seen corresponding path program 7 times [2018-09-20 13:56:21,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:21,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:21,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:21,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:21,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:21,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-20 13:56:21,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 13:56:21,931 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 13:56:21,932 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-20 13:56:21,932 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-09-20 13:56:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:22,101 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-20 13:56:22,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 13:56:22,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-09-20 13:56:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:22,105 INFO L225 Difference]: With dead ends: 42 [2018-09-20 13:56:22,106 INFO L226 Difference]: Without dead ends: 37 [2018-09-20 13:56:22,106 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-20 13:56:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-20 13:56:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-20 13:56:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-20 13:56:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-20 13:56:22,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-09-20 13:56:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:22,113 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-20 13:56:22,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 13:56:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-20 13:56:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 13:56:22,114 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:22,114 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:22,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -638504231, now seen corresponding path program 8 times [2018-09-20 13:56:22,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:22,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:22,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:22,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:22,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:22,375 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:22,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-20 13:56:22,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 13:56:22,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:22,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:22,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:22,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-20 13:56:22,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 13:56:22,453 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 13:56:22,453 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-20 13:56:22,453 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-09-20 13:56:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:22,616 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-20 13:56:22,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 13:56:22,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-09-20 13:56:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:22,619 INFO L225 Difference]: With dead ends: 45 [2018-09-20 13:56:22,619 INFO L226 Difference]: Without dead ends: 40 [2018-09-20 13:56:22,620 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-20 13:56:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-20 13:56:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-09-20 13:56:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-20 13:56:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-20 13:56:22,633 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-09-20 13:56:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:22,633 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-20 13:56:22,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 13:56:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-20 13:56:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 13:56:22,636 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:22,637 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:22,637 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1457599581, now seen corresponding path program 9 times [2018-09-20 13:56:22,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:22,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:22,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:22,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:56:22,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:56:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-20 13:56:22,953 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-20 13:56:22,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:22,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:22,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:22,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-20 13:56:22,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 13:56:23,000 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 13:56:23,000 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-20 13:56:23,000 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-09-20 13:56:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:23,078 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-20 13:56:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 13:56:23,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-09-20 13:56:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:23,081 INFO L225 Difference]: With dead ends: 47 [2018-09-20 13:56:23,081 INFO L226 Difference]: Without dead ends: 42 [2018-09-20 13:56:23,082 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-20 13:56:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-20 13:56:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-20 13:56:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-20 13:56:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-20 13:56:23,087 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-09-20 13:56:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:23,088 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-20 13:56:23,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 13:56:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-20 13:56:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 13:56:23,089 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:23,089 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:23,089 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 10 times [2018-09-20 13:56:23,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:23,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:23,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 13:56:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 13:56:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 13:56:23,149 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 13:56:23,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:56:23 BoogieIcfgContainer [2018-09-20 13:56:23,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 13:56:23,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 13:56:23,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 13:56:23,181 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 13:56:23,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:18" (3/4) ... [2018-09-20 13:56:23,185 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 13:56:23,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 13:56:23,186 INFO L168 Benchmark]: Toolchain (without parser) took 5152.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.2 MB in the beginning and 886.1 MB in the end (delta: 63.1 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:23,188 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:23,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.93 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:23,191 INFO L168 Benchmark]: Boogie Preprocessor took 35.31 ms. Allocated memory is still 1.0 GB. Free memory is still 938.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:23,191 INFO L168 Benchmark]: RCFGBuilder took 345.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:23,192 INFO L168 Benchmark]: TraceAbstraction took 4434.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.1 MB in the end (delta: 227.8 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:23,193 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 1.2 GB. Free memory is still 886.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:23,197 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.93 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.31 ms. Allocated memory is still 1.0 GB. Free memory is still 938.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 345.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4434.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.1 MB in the end (delta: 227.8 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.16 ms. Allocated memory is still 1.2 GB. Free memory is still 886.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 13. Possible FailurePath: [L8] float tick = 1.f / 10.f; [L9] float time = 0.f; [L10] int i; [L12] i = 0 VAL [i=0, time=0] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=0] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=1] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=2] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=3] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=4] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=5] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=6] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=7] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=8] [L12] i++ [L12] i++ [L12] COND TRUE i < 10 [L13] time += tick VAL [i=9] [L12] i++ [L12] i++ [L12] COND FALSE !(i < 10) VAL [i=10] [L15] CALL __VERIFIER_assert(time != 1.0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 4.3s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 55 SDslu, 447 SDs, 0 SdLazy, 178 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 30011 SizeOfPredicates, 9 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 13:56:25,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 13:56:25,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 13:56:25,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 13:56:25,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 13:56:25,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 13:56:25,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 13:56:25,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 13:56:25,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 13:56:25,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 13:56:25,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 13:56:25,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 13:56:25,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 13:56:25,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 13:56:25,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 13:56:25,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 13:56:25,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 13:56:25,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 13:56:25,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 13:56:25,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 13:56:25,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 13:56:25,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 13:56:25,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 13:56:25,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 13:56:25,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 13:56:25,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 13:56:25,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 13:56:25,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 13:56:25,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 13:56:25,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 13:56:25,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 13:56:25,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 13:56:25,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 13:56:25,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 13:56:25,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 13:56:25,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 13:56:25,698 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 13:56:25,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 13:56:25,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 13:56:25,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 13:56:25,716 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 13:56:25,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 13:56:25,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 13:56:25,717 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 13:56:25,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 13:56:25,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 13:56:25,719 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 13:56:25,720 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 13:56:25,720 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 13:56:25,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 13:56:25,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 13:56:25,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 13:56:25,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 13:56:25,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 13:56:25,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 13:56:25,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:25,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 13:56:25,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 13:56:25,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 13:56:25,724 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 13:56:25,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 13:56:25,724 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 13:56:25,724 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 13:56:25,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> ebf754a3963f6f2e62a58c5af4648497776f95f2 [2018-09-20 13:56:25,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 13:56:25,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 13:56:25,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 13:56:25,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 13:56:25,798 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 13:56:25,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:26,159 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6baf4cd/b92c88364b05441da29ba9b9bbeb9f5e/FLAGb33540779 [2018-09-20 13:56:26,316 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 13:56:26,317 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:26,324 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6baf4cd/b92c88364b05441da29ba9b9bbeb9f5e/FLAGb33540779 [2018-09-20 13:56:26,346 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6baf4cd/b92c88364b05441da29ba9b9bbeb9f5e [2018-09-20 13:56:26,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 13:56:26,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 13:56:26,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:26,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 13:56:26,365 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 13:56:26,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e949778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26, skipping insertion in model container [2018-09-20 13:56:26,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,385 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 13:56:26,644 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:26,674 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 13:56:26,681 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:26,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26 WrapperNode [2018-09-20 13:56:26,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:26,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 13:56:26,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 13:56:26,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 13:56:26,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... [2018-09-20 13:56:26,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 13:56:26,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 13:56:26,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 13:56:26,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 13:56:26,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:26,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 13:56:26,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 13:56:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 13:56:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 13:56:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 13:56:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 13:56:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 13:56:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 13:56:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 13:56:27,329 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 13:56:27,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:27 BoogieIcfgContainer [2018-09-20 13:56:27,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 13:56:27,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 13:56:27,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 13:56:27,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 13:56:27,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:56:26" (1/3) ... [2018-09-20 13:56:27,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edac4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:27, skipping insertion in model container [2018-09-20 13:56:27,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:26" (2/3) ... [2018-09-20 13:56:27,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edac4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:27, skipping insertion in model container [2018-09-20 13:56:27,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:27" (3/3) ... [2018-09-20 13:56:27,347 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth_true-unreach-call_true-termination.c [2018-09-20 13:56:27,366 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 13:56:27,380 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 13:56:27,464 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 13:56:27,465 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 13:56:27,465 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 13:56:27,465 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 13:56:27,465 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 13:56:27,466 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 13:56:27,466 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 13:56:27,466 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 13:56:27,466 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 13:56:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-20 13:56:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-20 13:56:27,504 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:27,505 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:27,507 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-09-20 13:56:27,519 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:27,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:27,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:27,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 13:56:27,618 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:56:27,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 13:56:27,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 13:56:27,636 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 13:56:27,637 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 13:56:27,639 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-09-20 13:56:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:27,665 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-09-20 13:56:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 13:56:27,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-20 13:56:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:27,677 INFO L225 Difference]: With dead ends: 32 [2018-09-20 13:56:27,677 INFO L226 Difference]: Without dead ends: 13 [2018-09-20 13:56:27,681 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 13:56:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-20 13:56:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-20 13:56:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-20 13:56:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-20 13:56:27,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-20 13:56:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:27,725 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-20 13:56:27,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 13:56:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-20 13:56:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-20 13:56:27,726 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:27,726 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:27,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-09-20 13:56:27,728 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:27,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:27,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:27,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 13:56:27,834 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:56:27,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 13:56:27,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 13:56:27,836 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 13:56:27,837 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 13:56:27,837 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-09-20 13:56:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:27,962 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-20 13:56:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 13:56:27,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-20 13:56:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:27,970 INFO L225 Difference]: With dead ends: 21 [2018-09-20 13:56:27,970 INFO L226 Difference]: Without dead ends: 16 [2018-09-20 13:56:27,971 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 13:56:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-20 13:56:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-20 13:56:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-20 13:56:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-20 13:56:27,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-09-20 13:56:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:27,978 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-20 13:56:27,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 13:56:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-20 13:56:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-20 13:56:27,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:27,979 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:27,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-09-20 13:56:27,980 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:28,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:28,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:56:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:28,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:28,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-20 13:56:28,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-20 13:56:28,208 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-20 13:56:28,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-20 13:56:28,209 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-09-20 13:56:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:28,436 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-09-20 13:56:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-20 13:56:28,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-09-20 13:56:28,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:28,442 INFO L225 Difference]: With dead ends: 29 [2018-09-20 13:56:28,442 INFO L226 Difference]: Without dead ends: 24 [2018-09-20 13:56:28,443 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-09-20 13:56:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-20 13:56:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-20 13:56:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-20 13:56:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-20 13:56:28,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2018-09-20 13:56:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:28,449 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-20 13:56:28,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-20 13:56:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-20 13:56:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-20 13:56:28,451 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:28,451 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:28,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 2 times [2018-09-20 13:56:28,452 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:28,452 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:28,458 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-20 13:56:28,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 13:56:28,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:28,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:28,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:56:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:29,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:56:29,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-20 13:56:29,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 13:56:29,166 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 13:56:29,167 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-09-20 13:56:29,167 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-09-20 13:56:30,100 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-09-20 13:56:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:30,691 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-09-20 13:56:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 13:56:30,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-20 13:56:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:30,699 INFO L225 Difference]: With dead ends: 47 [2018-09-20 13:56:30,699 INFO L226 Difference]: Without dead ends: 42 [2018-09-20 13:56:30,700 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-09-20 13:56:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-20 13:56:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-20 13:56:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-20 13:56:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-20 13:56:30,713 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 23 [2018-09-20 13:56:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:30,713 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-20 13:56:30,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 13:56:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-20 13:56:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 13:56:30,717 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:30,717 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:30,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 3 times [2018-09-20 13:56:30,718 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:30,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:30,733 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-20 13:56:31,217 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-09-20 13:56:31,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:56:31,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:31,676 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-20 13:56:33,120 WARN L178 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 13:56:34,499 WARN L178 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 13:56:41,789 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-20 13:56:57,106 WARN L178 SmtUtils]: Spent 3.25 s on a formula simplification that was a NOOP. DAG size: 18 [2018-09-20 13:57:05,579 WARN L178 SmtUtils]: Spent 2.72 s on a formula simplification that was a NOOP. DAG size: 19 [2018-09-20 13:57:14,195 WARN L178 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 13:57:43,341 WARN L178 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 13:57:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 128 refuted. 27 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:57:50,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:58:02,641 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-20 13:58:17,843 WARN L178 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 13:58:20,639 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:22,669 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:24,697 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:26,733 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:28,766 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:30,809 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:32,851 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:34,910 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:36,957 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:39,020 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:41,071 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:43,131 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:45,185 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:47,247 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:49,305 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:51,372 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 13:58:53,434 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-20 13:58:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 152 not checked. [2018-09-20 13:58:53,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:58:53,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-09-20 13:58:53,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-20 13:58:53,483 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-20 13:58:53,484 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=36, NotChecked=378, Total=756 [2018-09-20 13:58:53,484 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 28 states. [2018-09-20 13:58:55,572 WARN L819 $PredicateComparison]: unable to prove that (and (= (_ +zero 8 24) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-20 13:58:57,641 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~time~0) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-20 13:58:59,697 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from false [2018-09-20 13:59:01,748 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-20 13:59:03,800 WARN L797 $PredicateComparison]: unable to prove that (and (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from false [2018-09-20 13:59:07,259 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (= (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~time~0)) is different from true [2018-09-20 13:59:11,236 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from true [2018-09-20 13:59:13,274 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from false [2018-09-20 13:59:15,312 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-20 13:59:17,392 WARN L819 $PredicateComparison]: unable to prove that (and (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from true [2018-09-20 13:59:35,604 WARN L178 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 13:59:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:59:55,934 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-09-20 13:59:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-20 13:59:55,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-09-20 13:59:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:59:55,938 INFO L225 Difference]: With dead ends: 54 [2018-09-20 13:59:55,938 INFO L226 Difference]: Without dead ends: 48 [2018-09-20 13:59:55,940 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 187.5s TimeCoverageRelationStatistics Valid=103, Invalid=337, Unknown=48, NotChecked=918, Total=1406 [2018-09-20 13:59:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-20 13:59:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-20 13:59:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 13:59:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-20 13:59:55,954 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 41 [2018-09-20 13:59:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:59:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-20 13:59:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-20 13:59:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-20 13:59:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 13:59:55,963 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:59:55,963 INFO L376 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:59:55,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:59:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash -85797415, now seen corresponding path program 4 times [2018-09-20 13:59:55,964 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:59:55,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 13:59:55,979 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 13:59:56,288 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-20 13:59:56,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 13:59:56,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:59:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 64 proven. 155 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 13:59:56,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:59:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 64 proven. 155 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 13:59:57,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:59:57,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-09-20 13:59:57,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 13:59:57,150 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 13:59:57,151 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-09-20 13:59:57,151 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 24 states. [2018-09-20 13:59:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:59:59,283 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-20 13:59:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 13:59:59,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-09-20 13:59:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:59:59,284 INFO L225 Difference]: With dead ends: 48 [2018-09-20 13:59:59,285 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 13:59:59,286 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-09-20 13:59:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 13:59:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 13:59:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 13:59:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 13:59:59,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-09-20 13:59:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:59:59,287 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 13:59:59,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-20 13:59:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 13:59:59,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 13:59:59,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 14:00:04,604 WARN L178 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 30 DAG size of output: 7 [2018-09-20 14:04:30,313 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:149) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:196) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:985) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 31 more [2018-09-20 14:04:30,317 INFO L168 Benchmark]: Toolchain (without parser) took 483964.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 951.9 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 309.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:04:30,318 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:04:30,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:04:30,321 INFO L168 Benchmark]: Boogie Preprocessor took 48.67 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:04:30,321 INFO L168 Benchmark]: RCFGBuilder took 579.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:04:30,322 INFO L168 Benchmark]: TraceAbstraction took 482981.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.1 MB). Peak memory consumption was 337.8 MB. Max. memory is 11.5 GB. [2018-09-20 14:04:30,328 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.67 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 579.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 482981.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.1 MB). Peak memory consumption was 337.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...